Operational Determinism and Fast Algorithms

DOI10.1007/11817949_13MaRDI QIDQ5756602zbMATH OpenOpenAlexFDO

Authors Henri Hansen, Antti Valmari

Publication date 4 September 2007

Published in CONCUR 2006 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11817949_13

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• An O(m n) algorithm for branching bisimilarity on labelled transition systems
• Minimization Algorithm for Symbolic Bisimilarity
• Essential transitions to bisimulation equivalences
• Minimizing the number of transitions with respect to observation equivalence
• A fully symbolic bisimulation algorithm

This page was built for publication: Operational Determinism and Fast Algorithms

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