A fully symbolic bisimulation algorithm

DOI10.1007/978-3-642-24288-5_19zbMATH Open1348.68166OpenAlexW100098803MaRDI QIDQ3172876FDOQ3172876

Authors: Malcolm Mumme, Gianfranco Ciardo 

Publication date: 7 October 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-24288-5_19

Recommendations

• An efficient fully symbolic bisimulation algorithm for non-deterministic systems
• An efficient algorithm for computing bisimulation equivalence
• scientific article; zbMATH DE number 1796125
• Rank-based symbolic bisimulation: (and model checking)
• Sigref – A Symbolic Bisimulation Tool Box

zbMATH Keywords

verificationsaturationbisimulationlocalitydecision diagramssymbolic methods

Mathematics Subject Classification ID

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

Cited In (8)

• An efficient fully symbolic bisimulation algorithm for non-deterministic systems
• Sigref – A Symbolic Bisimulation Tool Box
• Two-layer symbolic representation for stochastic models with phase-type distributed events
• A distributed algorithm for strong bisimulation reduction of state spaces
• An efficient algorithm for computing bisimulation equivalence
• A complete symbolic bisimulation for full applied pi calculus
• Operational Determinism and Fast Algorithms
• Using bisimulations for optimality problems in model refinement

This page was built for publication: A fully symbolic bisimulation algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172876)