Bisimulation equivalence is decidable for all context-free processes
Information and Computation
Deciding true concurrency equivalences on safe, finite nets
ICALP Selected papers of the twentieth international colloquium on Automata, languages and programming
Information and Computation - Special issue on EXPRESS 1997
Communication and Concurrency
Deciding Finiteness of Petri Nets Up To Bisimulation
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
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
High Undecidability of Weak Bisimilarity for Petri Nets
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
The Linear Time-Branching Time Spectrum (Extended Abstract)
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Bisimulation Equivalence is Decidable for Basic Parallel Processes
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
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
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
Decidability of Strong Bisimilarity for Timed BPP
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Note on the Tableau Technique for Commutative Transition Systems
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
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
Complexity of weak bisimilarity and regularity for BPA and BPP
Mathematical Structures in 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
Decomposition and complexity of hereditary history preserving bisimulation on BPP
CONCUR 2005 - Concurrency Theory
Equivalence-checking on infinite-state systems: Techniques and results
Theory and Practice of Logic Programming
Decidability of performance equivalence for basic parallel processes
Theoretical Computer Science
Normed BPA vs. Normed BPP Revisited
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Reachability is decidable for weakly extended process rewrite systems
Information and Computation
Non-interleaving bisimulation equivalences on Basic Parallel Processes
Information and Computation
APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems
Bisimulation equivalence of a BPP and a finite-state system can be decided in polynomial time
Electronic Notes in Theoretical Computer Science (ENTCS)
On the computational complexity of bisimulation, redux
Information and Computation
Undecidability of weak bisimilarity for PA-processes
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Complexity of deciding bisimilarity between normed BPA and normed BPP
Information and Computation
Decidability of branching bisimulation on normed commutative context-free processes
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Weak bisimulation approximants
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Composition and decomposition in true-concurrency
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
| Hi-index | 0.00 |
We show that the problem of checking whether two processes definable in the syntax of Basic Parallel Processes (BPP) are strongly bisimilar is PSPACE-hard.We also demonstrate that there is a polynomial time reduction from the strong bisimilarity checking problem of regular BPP to the strong regularity (finiteness) checking of BPP. This implies that strong regularity of BPP is also PSPACE-hard.