Bisimulation Algorithms for Stochastic Process Algebras and Their BDD-Based Implementation

This publication has 19 references indexed in Scilit:

• An efficient algorithm for branching bisimulation and stuttering equivalence
  Published by Springer Nature ,2005
• Introduction to the ISO specification language LOTOS
  Published by Elsevier ,2003
• A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
  Theoretical Computer Science, 1998
• Stochastic process algebras – between LOTOS and Markov chains
  Computer Networks and ISDN Systems, 1998
• Markovian analysis of large finite state machines
  IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1996
• Branching time and abstraction in bisimulation semantics
  Journal of the ACM, 1996
• Bisimulation through probabilistic testing
  Information and Computation, 1991
• An implementation of an efficient algorithm for bisimulation equivalence
  Science of Computer Programming, 1990
• CCS expressions, finite state processes, and three problems of equivalence
  Information and Computation, 1990
• Three Partition Refinement Algorithms
  SIAM Journal on Computing, 1987