An efficient fully symbolic bisimulation algorithm for non-deterministic systems

DOI10.1142/S012905411340011XMaRDI QIDQ2842000zbMATH OpenFDO

Authors Malcolm Mumme, Gianfranco Ciardo

Publication date 30 July 2013

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S012905411340011X

zbMATH Keywords

algorithmsbisimulationdecision diagramslocalitysaturationsymbolic methodsverification

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• A fully symbolic bisimulation algorithm
• An efficient algorithm for computing bisimulation equivalence
• scientific article; zbMATH DE number 1796125
• An implementation of an efficient algorithm for bisimulation equivalence
• Sigref – A Symbolic Bisimulation Tool Box

Cites work

• A linear time solution to the single function coarsest partition problem
• An efficient algorithm for computing bisimulation equivalence
• An O(n log n) unidirectional distributed algorithm for extrema finding in a circle
• Compositional minimisation of finite state systems using interface specifications
• Three Partition Refinement Algorithms

Cited in

(14)

• Bisimulation and effectiveness
• An efficient algorithm for computing bisimulation equivalence
• Symbolic models for nonlinear time-delay systems using approximate bisimulations
• Approximate bisimulations and state reduction of fuzzy automata under fuzzy similarity measures
• Using bisimulations for optimality problems in model refinement
• A fully symbolic bisimulation algorithm
• Sigref – A Symbolic Bisimulation Tool Box
• Minimization Algorithm for Symbolic Bisimilarity
• Symbolic Branching Bisimulation-Checking of Dense-Time Systems in an Environment
• scientific article; zbMATH DE number 1796125 (Why is no real title available?)
• scientific article; zbMATH DE number 6970796 (Why is no real title available?)
• Rank-based symbolic bisimulation: (and model checking)
• Computing maximal weak and other bisimulations
• Equivalence checking 40 years after: a review of bisimulation tools

This page was built for publication: An efficient fully symbolic bisimulation algorithm for non-deterministic systems

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