AN EFFICIENT FULLY SYMBOLIC BISIMULATION ALGORITHM FOR NON-DETERMINISTIC SYSTEMS

DOI10.1142/S012905411340011XzbMath1353.68209MaRDI QIDQ2842000

Gianfranco Ciardo, Malcolm Mumme

Publication date: 30 July 2013

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

zbMATH Keywords

verificationalgorithmsbisimulationlocalitysaturationdecision diagramssymbolic methods

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)

Related Items

Equivalence checking 40 years after: a review of bisimulation tools, Approximate bisimulations and state reduction of fuzzy automata under fuzzy similarity measures

Cites Work

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