Computing maximal weak and other bisimulations
DOI10.1007/S00165-016-0366-2zbMATH Open1355.68190OpenAlexW2330102972MaRDI QIDQ510897FDOQ510897
Authors: Alexandre Boulgakov, Thomas Gibson-Robinson, 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
Recommendations
- An efficient algorithm for computing bisimulation equivalence
- scientific article; zbMATH DE number 1796125
- scientific article; zbMATH DE number 1759621
- An implementation of an efficient algorithm for bisimulation equivalence
- An efficient fully symbolic bisimulation algorithm for non-deterministic systems
FDRCSPbisimulationweak bisimulationmodel-checkinglabelled transition systemsdelay bisimulationstrong bisimulation
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A distributed algorithm for strong bisimulation reduction of state spaces
- A theory of bisimulation for the \(\pi\)-calculus
- An efficient algorithm for computing bisimulation equivalence
- An implementation of an efficient algorithm for bisimulation equivalence
- Branching time and abstraction in bisimulation semantics
- CADP 2010: a toolbox for the construction and analysis of distributed processes
- Computing maximal weak and other bisimulations
- Depth-First Search and Linear Graph Algorithms
- Edge-disjoint spanning trees and depth-first search
- FDR3 -- a modern refinement checker for CSP
- Sigref – A Symbolic Bisimulation Tool Box
- Three Partition Refinement Algorithms
- Understanding concurrent systems
Cited In (8)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On cool congruence formats for weak bisimulations
- Equivalence checking 40 years after: a review of bisimulation tools
- New up-to techniques for weak bisimulation
- Computing maximal weak and other bisimulations
- \textit{\textsf{Circus2CSP}}: a tool for model-checking \textit{\textsf{Circus}} using FDR
- Towards a model-checker for \textit{\textsf{Circus}}
Uses Software
This page was built for publication: Computing maximal weak and other bisimulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q510897)
