On-the-Fly Branching Bisimulation Minimization for Compositional Analysis

DOI10.1007/11812128_21MaRDI QIDQ5757250zbMATH OpenOpenAlexFDO

Authors Y. P. Cheng, Hong-Yi Wang, Yu-Ru Cheng

Publication date 6 September 2007

Published in Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11812128_21

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 177239
• Bisimulation minimization and symbolic model checking
• Essential transitions to bisimulation equivalences
• scientific article; zbMATH DE number 177514
• SMT-based bisimulation minimisation of Markov models

Cited in

(5)

• Deciding Hopf bifurcations by quantifier elimination in a software-component architecture
• Unification and combination of a class of traversal strategies made with pattern matching and fixed-points
• scientific article; zbMATH DE number 177239 (Why is no real title available?)
• scientific article; zbMATH DE number 177514 (Why is no real title available?)
• Equivalence checking 40 years after: a review of bisimulation tools

This page was built for publication: On-the-Fly Branching Bisimulation Minimization for Compositional Analysis

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