A parallel relation-based algorithm for symbolic bisimulation minimization

DOI10.1007/978-3-030-11245-5_25MaRDI QIDQ2287115zbMATH OpenOpenAlexFDO

Authors Richard Huybers, Alfons W. Laarman

Publication date 23 January 2020

Full work available at URL https://doi.org/10.1007/978-3-030-11245-5_25

zbMATH Keywords

parallel computingsymbolic model checkingdecision diagramsbisimulation minimizationBDDs

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Bisimulation minimization and symbolic model checking
• Minimization Algorithm for Symbolic Bisimilarity
• An efficient algorithm for computing bisimulation equivalence
• Implementation and Application of Automata
• From bisimulation to simulation: Coarsest partition problems

Cited in

(3)

• Equivalence checking 40 years after: a review of bisimulation tools
• Bisimulation minimization and symbolic model checking
• Minimisation of spatial models using branching bisimilarity

This page was built for publication: A parallel relation-based algorithm for symbolic bisimulation minimization

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