The parametric complexity of bisimulation equivalence of normed pushdown automata

2021 ◽  
Vol 16 (4) ◽  
Author(s):  
Wenbo Zhang
Keyword(s):  
Bisimulation Equivalence ◽  
Pushdown Automata

scholarly journals Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation

2006 ◽  
Vol 13 (13) ◽  
Author(s):  
Jirí Srba
Keyword(s):  
Lower Bound ◽  
Lower Bounds ◽  
Process Algebra ◽  
Upper And Lower Bounds ◽  
Equivalence Checking ◽  
Basic Process ◽  
Bisimulation Equivalence ◽  
Language Equivalence ◽  
Visibly Pushdown Automata ◽  
Pushdown Automata

We investigate the possibility of (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 preorders and equivalences like simulation, completed simulation, ready simulation, 2-nested simulation preorders/equivalences and bisimulation equivalence. Our main results are that all the mentioned equivalences and preorders are EXPTIME-complete on visibly pushdown automata, PSPACE-complete on visibly one-counter automata and P-complete on visibly BPA. Our PSPACE lower bound for visibly one-counter automata improves also the previously known DP-hardness results for ordinary one-counter automata and one-counter nets. Finally, we study regularity checking problems for visibly pushdown automata and show that they can be decided in polynomial time.

scholarly journals Higher-order Recursion Schemes and Collapsible Pushdown Automata: Logical Properties

2021 ◽  
Vol 22 (2) ◽  
pp. 1-37
Author(s):  
Christopher H. Broadbent ◽  
Arnaud Carayol ◽  
C.-H. Luke Ong ◽  
Olivier Serre
Keyword(s):  
Model Checking ◽  
Free Variable ◽  
Higher Order ◽  
Second Order ◽  
Effective Solution ◽  
Parity Games ◽  
Transition Graphs ◽  
Second Order Logic ◽  
Pushdown Automata ◽  
Monadic Second Order Logic

This article studies the logical properties of a very general class of infinite ranked trees, namely, those generated by higher-order recursion schemes. We consider, for both monadic second-order logic and modal -calculus, three main problems: model-checking, logical reflection (a.k.a. global model-checking, that asks for a finite description of the set of elements for which a formula holds), and selection (that asks, if exists, for some finite description of a set of elements for which an MSO formula with a second-order free variable holds). For each of these problems, we provide an effective solution. This is obtained, thanks to a known connection between higher-order recursion schemes and collapsible pushdown automata and on previous work regarding parity games played on transition graphs of collapsible pushdown automata.

scholarly journals From Security Protocols to Pushdown Automata

2015 ◽  
Vol 17 (1) ◽  
pp. 1-45 ◽  
Author(s):  
Rémy Chrétien ◽  
Véronique Cortier ◽  
Stéphanie Delaune
Keyword(s):  
Security Protocols ◽  
Pushdown Automata

scholarly journals Reachability relations of timed pushdown automata

2021 ◽  
Vol 117 ◽  
pp. 202-241
Author(s):  
Lorenzo Clemente ◽  
Sławomir Lasota
Keyword(s):  
Pushdown Automata

Pushdown Automata

2019 ◽  
pp. 161-182
Author(s):  
Ganesh Lalitha Gopalakrishnan
Keyword(s):  
Pushdown Automata
Sign in / Sign up

Export Citation Format

Share Document