Search

• < Previous
• 1
• Next >

---

Beyond Language Equivalence on Visibly Pushdown Automata

Jiří Srba.

We study (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basic Process Algebra) and visibly one-counter automata. We describe generic methods for proving complexity upper and lower bounds for a number of studied&nbsp;[&hellip;]

---

Stubborn Set Reduction for Two-Player Reachability Games

Frederik Meyer Bønneland ; Peter Gjøl Jensen ; Kim Guldstrand Larsen ; Marco Muñiz ; Jiří Srba.

Partial order reductions have been successfully applied to model checking of concurrent systems and practical applications of the technique show nontrivial reduction in the size of the explored state space. We present a theory of partial order reduction based on stubborn sets in the game-theoretical&nbsp;[&hellip;]

---