Decidability results in automata and process theory
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 102-148
- https://doi.org/10.1007/3-540-60915-6_4
Abstract
No abstract availableThis publication has 34 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
- Model checking for 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
- Decidable Subsets of CCSThe Computer Journal, 1994
- Decidability of bisimulation equivalence for process generating context-free languagesJournal of the ACM, 1993
- Bisimulation equivalence is decidable for basic parallel processesPublished by Springer Nature ,1993
- Algebra of communicating processes with abstractionTheoretical Computer Science, 1985
- Notes on Algebraic Calculi of ProcessesPublished by Springer Nature ,1985
- A Theory of Communicating Sequential ProcessesJournal of the ACM, 1984