An efficient algorithm for branching bisimulation and stuttering equivalence

This publication has 8 references indexed in Scilit:

• Back and forth bisimulations
  Published by Springer Nature ,1990
• Characterizing finite Kripke structures in propositional temporal logic
  Theoretical Computer Science, 1988
• Three Partition Refinement Algorithms
  SIAM Journal on Computing, 1987
• Research on Automatic Verification of Finite-State Concurrent Systems
  Annual Review of Computer Science, 1987
• Matrix multiplication via arithmetic progressions
  Published by Association for Computing Machinery (ACM) ,1987
• “Sometimes” and “not never” revisited
  Journal of the ACM, 1986
• CCS expressions, finite state processes, and three problems of equivalence
  Published by Association for Computing Machinery (ACM) ,1983
• A Calculus of Communicating Systems
  Lecture Notes in Computer Science, 1980