Bisimulation equivalence is decidable for all context-free processes
- 30 September 2006
- book chapter
- Published by Springer Nature
- p. 138-147
- https://doi.org/10.1007/bfb0084788
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Actions speak louder than words: proving bisimilarity for context-free processesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A short proof of the decidability of bisimulation for normed bpa-processesInformation Processing Letters, 1992
- Process theory based on bisimulation semanticsPublished by Springer Nature ,1989
- Decidability of bisimulation equivalence for processes generating context-free languagesPublished by Springer Nature ,1987
- Decidabilite de l'egalite des Langages Algebriques Infinitaires SimplesPublished by Springer Nature ,1986
- The theory of ends, pushdown automata, and second-order logicTheoretical Computer Science, 1985
- A complete inference system for a class of regular behavioursJournal of Computer and System Sciences, 1984
- Process algebra for synchronous communicationInformation and Control, 1984