Decidability of bisimulation equivalence for processes generating context-free languages
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
The linear time-branching time spectrum (extended abstract)
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
A short proof of the decidability of bisimulation for normed BPA-processes
Information Processing Letters
Decidability of bisimulation equivalence for process generating context-free languages
Journal of the ACM (JACM)
Undecidable equivalences for basic process algebra
Information and Computation
On deciding readiness and failure equivalences for processes
Information and Computation
Undecidability of bisimilarity for Petri nets and some related problems
STACS '94 Selected papers of the eleventh symposium on Theoretical aspects of computer science
Bisimulation equivalence is decidable for all context-free processes
Information and Computation
Decidability results in automata and process theory
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Communication and Concurrency
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
Bisimulation Equivalence is Decidable for One-Counter Processes
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Bisimulation Equivalence is Decidable for all Context-Free Processes
CONCUR '92 Proceedings of the Third 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
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
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
Undecidability of weak bisimilarity for PA-processes
DLT'02 Proceedings of the 6th international conference on Developments in language theory
| Hi-index | 5.23 |
Bisimilarity and regularity are decidable properties for the class of BPA (or context-free) processes (Christensen et al., Inform. and Comput. 121 (1995) 143-148; Burkart et al., Proc. CONCUR'96, Lecture Notes in Computer Science, Vol. 1119, Springer, Berlin, 1996, pp. 247-262). We extend BPA with a deadlocking state obtaining BPA &dgr;systems. We show that the BPA &dgr; class is more expressive w.r.t. bisimilarity, but it remains language equivalent to BPA. We prove that bisimilarity and regularity remain decidable for BPA &dgr;. Finally, we give a characterisation of those BPA&dgr; processes that can be equivalently (up to bisimilarity) described within the "pure" BPA syntax. Copyright 2001 Elsevier Science B.V.