Polynomial time algorithms for testing probabilistic bisimulation and simulation

This publication has 19 references indexed in Scilit:

• An efficient algorithm for branching bisimulation and stuttering equivalence
  Published by Springer Nature ,2005
• Specification and refinement of probabilistic processes
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Compositional testing preorders for probabilistic processes
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• A logic for reasoning about time and reliability
  Formal Aspects of Computing, 1994
• Generating BDDs for symbolic model checking in CCS
  Distributed Computing, 1993
• Testing preorders for probabilistic processes
  Published by Springer Nature ,1992
• Bisimulation through probabilistic testing
  Information and Computation, 1991
• Verifying temporal properties of finite-state probabilistic programs
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1988
• Probabilistic temporal logics for finite and bounded models
  Published by Association for Computing Machinery (ACM) ,1984
• CCS expressions, finite state processes, and three problems of equivalence
  Published by Association for Computing Machinery (ACM) ,1983