A fast algorithm for deciding bisimilarity of normed context-free processes

This publication has 10 references indexed in Scilit:

• Bisimulation equivalence is decidable for all context-free processes
  Published by Springer Nature ,2006
• Concurrency and automata on infinite sequences
  Published by Springer Nature ,2005
• Actions speak louder than words: proving bisimilarity for context-free processes
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Undecidable Equivalences for Basic Process Algebra
  Information and Computation, 1994
• Deciding bisimilarity of normed context-free processes is in Σp2
  Theoretical Computer Science, 1994
• A Fast Algorithm for Deciding Bisimilarity of Normed Context-Free Processes
  Published by Springer Nature ,1994
• Unique decomposition of processes
  Theoretical Computer Science, 1993
• A short proof of the decidability of bisimulation for normed bpa-processes
  Information Processing Letters, 1992
• The linear time - branching time spectrum
  Published by Springer Nature ,1990
• Decidability of bisimulation equivalence for processes generating context-free languages
  Published by Springer Nature ,1987