Structural analysis of Boolean equation systems
From MaRDI portal
Abstract: We analyse the problem of solving Boolean equation systems through the use of structure graphs. The latter are obtained through an elegant set of Plotkin-style deduction rules. Our main contribution is that we show that equation systems with bisimilar structure graphs have the same solution. We show that our work conservatively extends earlier work, conducted by Keiren and Willemse, in which dependency graphs were used to analyse a subclass of Boolean equation systems, viz., equation systems in standard recursive form. We illustrate our approach by a small example, demonstrating the effect of simplifying an equation system through minimisation of its structure graph.
Recommendations
Cited in
(7)- Parameterised Boolean equation systems
- Consistent consequence for Boolean equation systems
- UN-KLEENE BOOLEAN EQUATION SOLVING
- scientific article; zbMATH DE number 1538042 (Why is no real title available?)
- Analysis of Boolean equation systems through structure graphs
- Analysis of Boolean Programs
- Theoretical Aspects of Computing – ICTAC 2005
This page was built for publication: Structural analysis of Boolean equation systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946656)