An algorithm for reducing binary branchings

DOI10.1007/3-540-60692-0_55MaRDI QIDQ2956689zbMATH OpenOpenAlexFDO

Authors Paul Caspi, Jean-Claude Fernandez, Alain Girault

Publication date 19 January 2017

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60692-0_55

zbMATH Keywords

observational equivalenceobject code optimizationon-the-fly bisimulation

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Jump Minimization in Linear Time
• An implementation of an efficient algorithm for bisimulation equivalence
• P-functions: A new tool for the analysis and synthesis of binary programs
• An \(O(m \log n)\) algorithm for branching bisimilarity on labelled transition systems
• Branching Programs and Binary Decision Diagrams

Cited in

(2)

• An optimal algorithm for purging regular hammocks
• Recent Advances in Constraints

This page was built for publication: An algorithm for reducing binary branchings

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