Minimization Algorithm for Symbolic Bisimilarity

DOI10.1007/978-3-642-00590-9_20MaRDI QIDQ3617705zbMATH OpenOpenAlexFDO

Authors Filippo Bonchi, Ugo Montanari

Publication date 31 March 2009

Published in Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL http://eprints.adm.unipi.it/2220/1/TR%2D08%2D27.pdf.gz

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Coalgebraic symbolic semantics
• An efficient fully symbolic bisimulation algorithm for non-deterministic systems
• An efficient algorithm for computing bisimulation equivalence
• Bisimilarity Minimization in O(m logn) Time
• Simple bisimilarity minimization in \(O(m \log n)\) time

Cited in

(5)

• A partition refinement algorithm for the -calculus
• Bisimulation minimization and symbolic model checking
• A parallel relation-based algorithm for symbolic bisimulation minimization
• Operational Determinism and Fast Algorithms
• Coalgebraic symbolic semantics

This page was built for publication: Minimization Algorithm for Symbolic Bisimilarity

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