Three partition refinement algorithms
SIAM Journal on Computing
Process algebra
On the regular structure of prefix rewriting
CAAP '90 Selected papers of the conference on Fifteenth colloquium on trees in algebra and programming
Undecidability of bisimilarity for Petri nets and some related problems
STACS '94 Selected papers of the eleventh symposium on Theoretical aspects of computer science
A polynomial algorithm for deciding bisimilarity of normed context-free processes
Theoretical Computer Science
Information and Computation - Special issue on EXPRESS 1997
Communication and Concurrency
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Bisimulation Equivanlence Is Decidable for Normed Process Algebra
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Deciding Finiteness of Petri Nets Up To Bisimulation
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
The Equivalence Problem for Deterministic Pushdown Automata is Decidable
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Deciding Bisimulation-Like Equivalences with Finite-State Processes
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Reachability Analysis of Pushdown Automata: Application to Model-Checking
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Bisimulation Equivalence is Decidable for Basic Parallel Processes
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Checking Regular Properties of Petri Nets
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Bisimulation Collapse and the Process Taxonomy
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Regularity is Decidable for Normed PA Processes in Polynomial Time
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
On the Complexity of Bisimulation Problems for Basic Parallel Processes
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Decidability of Bisimulation Equivalence for Equational Graphs of Finite Out-Degree
FOCS '98 Proceedings of the 39th Annual Symposium on 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
Undecidability of Weak Bisimilarity for Pushdown Processes
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Why Is Simulation Harder than Bisimulation?
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Equivalence-Checking with Infinite-State Systems: Techniques and Results
SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Information and Computation
Complexity bounds for the verification of real-time software
VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
BPA bisimilarity is EXPTIME-hard
Information Processing Letters
Hi-index | 0.00 |
All bisimulation problems for pushdown automata are at least PSPACE-hard. In particular, we show that (1) Weak bisimilarity of pushdown automata and finite automata is PSPACE-hard, even for a small fixed finite automaton, (2) Strong bisimilarity of pushdown automata and finite automata is PSPACE-hard, but polynomial for every fixed finite automaton, (3) Regularity (finiteness) of pushdown automata w.r.t. weak and strong bisimilarity is PSPACE-hard.