Three partition refinement algorithms
SIAM Journal on Computing
Undecidable equivalences for basic process algebra
Information and Computation
Decidability of bisimilarity for one-counter processes
Information and Computation
Pushdown processes: games and model-checking
Information and Computation - Special issue on FLOC '96
An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
On the Complexity of Semantic Equivalences for Pushdown Automata and BPA
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
2-Nested Simulation Is Not Finitely Equationally Axiomatizable
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Reachability Analysis of Pushdown Automata: Application to Model-Checking
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Bisimulation Collapse and the Process Taxonomy
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Simulation Problems for One-Counter Machines
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
P-Hardness of Equivalence Testing on Finite-State Processes
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
Decidability of Bisimulation Equivalence for Equational Graphs of Finite Out-Degree
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
DP Lower bounds for equivalence-checking and model-checking of one-counter automata
Information and Computation
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Regularity problems for visibly pushdown languages
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Parity games played on transition graphs of one-counter processes
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Congruences for visibly pushdown languages
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Third-order idealized algol with iteration is decidable
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Complexity bounds for the verification of real-time software
VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
Height-deterministic pushdown automata
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
| Hi-index | 0.00 |
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.