Bisimulation equivalence is decidable for all context-free processes
Information and Computation
A polynomial algorithm for deciding bisimilarity of normed context-free processes
Theoretical Computer Science
Information and Computation - Special issue on EXPRESS 1997
An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Deciding Finiteness of Petri Nets Up To Bisimulation
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Strong Bisimilarity and Regularity of Basic Parallel Processes Is PSPACE-Hard
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
On the Ehrenfeucht-Fraïssé Game in Theoretical Computer Science
TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Bisimulation Equivalence is Decidable for Basic Parallel Processes
CONCUR '93 Proceedings of the 4th 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 BPA and Normed BPP Processes in Polynomial Time
SOFSEM '96 Proceedings of the 23rd Seminar on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
On the Complexity of Bisimulation Problems for Basic Parallel Processes
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Undecidability of Weak Bisimilarity for Pushdown Processes
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
On the computational complexity of bisimulation, redux
PCK50 Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday
The complexity of bisimilarity-checking for one-counter processes
Theoretical Computer Science
On the computational complexity of bisimulation, redux
Information and Computation - Special issue: Commemorating the 50th birthday anniversary of Paris C. Kanellakis
Weak bisimilarity and regularity of context-free processes is EXPTIME-hard
Theoretical Computer Science - Expressiveness in concurrency
Equivalence-checking on infinite-state systems: Techniques and results
Theory and Practice of Logic Programming
Undecidability of bisimilarity by defender's forcing
Journal of the ACM (JACM)
Normed BPA vs. Normed BPP Revisited
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Deciding Bisimilarity of Full BPA Processes Locally
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems
On the computational complexity of bisimulation, redux
Information and Computation
Information and Computation
Complexity of deciding bisimilarity between normed BPA and normed BPP
Information and Computation
Bisimilarity of one-counter processes is PSPACE-complete
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Undecidability results for bisimilarity on prefix rewrite systems
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Visibly pushdown automata: from language equivalence to simulation and bisimulation
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Weak bisimulation approximants
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Checking equality and regularity for normed BPA with silent moves
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Bisimulation equivalence and regularity for real-time one-counter automata
Journal of Computer and System Sciences
| Hi-index | 0.00 |
Strong bisimilarity and regularity checking problems of Basic Process Algebra (BPA) are decidable, with the complexity upper bounds 2-EXPTIME. On the other hand, no lower bounds were known. In this paper we demonstrate PSPACE-hardness of these problems.