A Fast Algorithm for Deciding Bisimilarity of Normed Context-Free Processes
- 1 January 1994
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Deciding bisimilarity of normed context-free processes is in Σp2Theoretical Computer Science, 1994
- A Fast Algorithm for Deciding Bisimilarity of Normed Context-Free ProcessesPublished by Springer Nature ,1994
- Unique decomposition of processesTheoretical Computer Science, 1993
- 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