A polynomial algorithm for deciding bisimilarity of normed context-free processes
Theoretical Computer Science
Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time
Theoretical Computer Science
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
Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard
ICALP '02 Proceedings of the 29th 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
Strong Bisimilarity on Basic Parallel Processes is PSPACE-complete
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Faster algorithm for bisimulation equivalence of normed context-free processes
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Selected Ideas Used for Decidability and Undecidability of Bisimilarity
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Partially-Commutative Context-Free Processes
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Complexity of deciding bisimilarity between normed BPA and normed BPP
Information and Computation
Partially-commutative context-free processes: Expressibility and tractability
Information and Computation
| Hi-index | 0.00 |
We present a polynomial-time algorithm deciding bisimilarity between a normed BPA process and a normed BPP process. This improves the previously known exponential upper bound by Černá, Křetínský, Ku茂戮驴era (1999). The algorithm relies on a polynomial bound for the "finite-state core" of the transition system generated by the BPP process. The bound is derived from the "prime form" of the underlying BPP system (where bisimilarity coincides with equality); we suggest an original algorithm for the respective transformation.