scientific article

zbMath1020.68062MaRDI QIDQ2760243

Rance Cleaveland, Oleg Sokolsky

Publication date: 18 December 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

partition refinement

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

An efficient algorithm for computing bisimulation equivalence, Conjunction on processes: Full abstraction via ready-tree semantics, An invariant-based approach to the verification of asynchronous parameterized networks, A Simpler Alternative: Minimizing Transition Systems Modulo Alternating Simulation Equivalence, Selected Ideas Used for Decidability and Undecidability of Bisimilarity, An efficient simulation algorithm on Kripke structures, Constructive logical characterizations of bisimilarity for reactive probabilistic systems, Ensuring liveness properties of distributed systems: open problems, Unnamed Item, Approximating Markovian testing equivalence, An efficient simulation algorithm based on abstract interpretation, Improved algorithms for computing the greatest right and left invariant Boolean matrices and their application, Program algebra with unit instruction operators