Decidability of bisimulation equivalence for normed pushdown processes
- 1 January 1996
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 217-232
- https://doi.org/10.1007/3-540-61604-7_57
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Actions speak louder than words: proving bisimilarity for context-free processesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Bisimulation Equivalence Is Decidable for All Context-Free ProcessesInformation and Computation, 1995
- Undecidable Equivalences for Basic Process AlgebraInformation and Computation, 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
- 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