Bisimulation equivalence is decidable for basic parallel processes
- 1 January 1993
- book chapter
- Published by Springer Nature
- p. 143-157
- https://doi.org/10.1007/3-540-57208-2_11
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Distributed bisimularity is decidable for a class of infinite state-space systemsPublished by Springer Nature ,2006
- Bisimulation equivalence is decidable for all context-free processesPublished by Springer Nature ,2006
- Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A completeness theorem for Kleene algebras and the algebra of regular eventsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Decidability questions for bisimilarity of Petri nets and some related problemsPublished by Springer Nature ,1994
- A short proof of the decidability of bisimulation for normed bpa-processesInformation Processing Letters, 1992
- The linear time - branching time spectrumPublished by Springer Nature ,1990
- Decidability of bisimulation equivalence for processes generating context-free languagesPublished by Springer Nature ,1987
- A complete inference system for a class of regular behavioursJournal of Computer and System Sciences, 1984
- Two Complete Axiom Systems for the Algebra of Regular EventsJournal of the ACM, 1966