Analysis of Boolean equation systems through structure graphs
From MaRDI portal
Publication:5150133
zbMATH Open1454.68066MaRDI QIDQ5150133FDOQ5150133
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
Recommendations
Specification and verification (program logics, model checking, etc.) (68Q60) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Logical aspects of Boolean algebras (03G05)
Cited In (9)
- Title not available (Why is that?)
- Verification of reactive systems via instantiation of parameterised Boolean equation systems
- Consistent consequence for Boolean equation systems
- Solution-Graphs of Boolean Formulas and Isomorphism
- Title not available (Why is that?)
- Static Analysis of Boolean Networks Based on Interaction Graphs: A Survey
- Structural analysis of Boolean equation systems
- Graph theoretic and Boolean conditions for structurally fixed modes of augmented system forms
- Solution-Graphs of Boolean Formulas and Isomorphism1
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)