Bisimulation collapse and the process taxonomy
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 247-262
- https://doi.org/10.1007/3-540-61604-7_59
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Bisimulation equivalence is decidable for all context-free processesPublished by Springer Nature ,2006
- Regularity for a large class of context-free processes is decidablePublished by Springer Nature ,1996
- An elementary bisimulation decision procedure for arbitrary context-free processesPublished by Springer Nature ,1995
- A Fast Algorithm for Deciding Bisimilarity of Normed Context-Free ProcessesPublished by Springer Nature ,1994
- Bisimulation equivalence is decidable for basic parallel processesPublished by Springer Nature ,1993
- On the regular structure of prefix rewritingTheoretical Computer Science, 1992
- A short proof of the decidability of bisimulation for normed bpa-processesInformation Processing Letters, 1992
- On the transition graphs of automata and grammarsPublished by Springer Nature ,1991
- Decidability of bisimulation equivalence for processes generating context-free languagesPublished by Springer Nature ,1987
- Regular canonical systemsArchive for Mathematical Logic, 1964