Analysis of Boolean equation systems through structure graphs

MaRDI QIDQ5150133zbMATH OpenFDO

Authors Michel A. Reniers, T. A. C. Willemse

Publication date 9 February 2021

Full work available at URL http://eptcs.web.cse.unsw.edu.au/paper.cgi?SOS2009.7

Mathematics Subject Classification ID

Logical aspects of Boolean algebras (03G05) Semantics in the theory of computing (68Q55) 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

• Structural analysis of Boolean equation systems
• Parameterised Boolean equation systems
• CONCUR 2004 - Concurrency Theory
• Proof graphs for parameterised Boolean equation systems
• Tools and Algorithms for the Construction and Analysis of Systems

Cited in

(9)

• Solution-Graphs of Boolean Formulas and Isomorphism
• Consistent consequence for Boolean equation systems
• Structural analysis of Boolean equation systems
• Efficient diagnostic generation for Boolean equation systems
• Alternating fixed points in Boolean equation systems as preferred stable models
• Solution-Graphs of Boolean Formulas and Isomorphism1
• Static Analysis of Boolean Networks Based on Interaction Graphs: A Survey
• Graph theoretic and Boolean conditions for structurally fixed modes of augmented system forms
• Verification of reactive systems via instantiation of parameterised Boolean equation systems

This page was built for publication: Analysis of Boolean equation systems through structure graphs

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