Computing maximal weak and other bisimulations

DOI10.1007/s00165-016-0366-2zbMath1355.68190OpenAlexW2330102972MaRDI QIDQ510897

Thomas Gibson-Robinson, Alexandre Boulgakov, A. W. Roscoe

Publication date: 14 February 2017

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-016-0366-2

zbMATH Keywords

model-checkingbisimulationCSPstrong bisimulationlabelled transition systemsweak bisimulationFDRdelay bisimulation

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Unnamed Item, Equivalence checking 40 years after: a review of bisimulation tools, Computing maximal weak and other bisimulations

Uses Software

• SIGREF
• CADP
• FDR3
• Algorithm 97

Cites Work

• Computing maximal weak and other bisimulations
• An implementation of an efficient algorithm for bisimulation equivalence
• Edge-disjoint spanning trees and depth-first search
• An efficient algorithm for computing bisimulation equivalence
• A theory of bisimulation for the \(\pi\)-calculus
• Understanding concurrent systems
• CADP 2010: A Toolbox for the Construction and Analysis of Distributed Processes
• Sigref – A Symbolic Bisimulation Tool Box
• Three Partition Refinement Algorithms
• Branching time and abstraction in bisimulation semantics
• FDR3 — A Modern Refinement Checker for CSP
• Depth-First Search and Linear Graph Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item