A distributed algorithm for strong bisimulation reduction of state spaces

MaRDI QIDQ2842853zbMATH OpenFDO

Authors Stefan Blom, Simona Orzan

Publication date 16 August 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571066105803901

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Distributed algorithms (68W15) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Distributed branching bisimulation reduction of state spaces
• Distributed Markovian bisimulation reduction aimed at CSL model checking
• Distributed partial order reduction of state spaces
• A fully symbolic bisimulation algorithm
• A probabilistic dynamic technique for the distributed generation of very large state spaces

Cited in

(14)

• Efficient and modular coalgebraic partition refinement
• Application of bipartite graphs for achieving race-free state assignments
• On the computational complexity of bisimulation, redux
• Equivalence checking 40 years after: a review of bisimulation tools
• Sharp congruences adequate with temporal logics combining weak and strong modalities
• Distributed Markovian bisimulation reduction aimed at CSL model checking
• Distributed branching bisimulation reduction of state spaces
• A database approach to distributed state-space generation
• Computing maximal weak and other bisimulations
• A state space distribution policy based on abstract interpretation
• Computing \(k\)-bisimulations for large graphs: a comparison and efficiency analysis
• Distributed coalgebraic partition refinement
• Efficient Coalgebraic Partition Refinement
• Cartesian difference categories

This page was built for publication: A distributed algorithm for strong bisimulation reduction of state spaces

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