Failure-based Equivalences Are Faster Than Many Believe

This publication has 16 references indexed in Scilit:

• The weakest compositional semantic equivalence preserving nexttime-less linear temporal logic
  Published by Springer Nature ,2006
• On-the-fly verification with stubborn sets
  Published by Springer Nature ,1993
• Memory-efficient algorithms for the verification of temporal properties
  Formal Methods in System Design, 1992
• The Temporal Logic of Reactive and Concurrent Systems
  Published by Springer Nature ,1992
• Minimizing the number of transitions with respect to observation equivalence
  BIT Numerical Mathematics, 1991
• CCS expressions, finite state processes, and three problems of equivalence
  Information and Computation, 1990
• The concurrency workbench
  Published by Springer Nature ,1990
• Exposure to deadlock for communicating processes is hard to detect
  Information Processing Letters, 1985
• A Theory of Communicating Sequential Processes
  Journal of the ACM, 1984
• Complexity of some problems in Petri nets
  Theoretical Computer Science, 1977