A Formalisation of Consistent Consequence for Boolean Equation Systems

Author(s):  
Myrthe van Delft ◽  
Herman Geuvers ◽  
Tim A. C. Willemse
Keyword(s):  
2011 ◽  
Vol 209 (4) ◽  
pp. 637-663 ◽  
Author(s):  
B. Ploeger ◽  
J.W. Wesselink ◽  
T.A.C. Willemse

Filomat ◽  
2020 ◽  
Vol 34 (4) ◽  
pp. 1261-1270
Author(s):  
Ulfeta Marovac ◽  
Dragic Bankovic

In this paper elementary generalized systems of Boolean equations are investigated. The formula for solving systems of k Boolean inequations and a Boolean equation is presented. This systems have many applications in computer science for solving logical problems. Presented formulas can accelerate application of elementary generalized systems of Boolean equations.


2015 ◽  
Vol 28 (1) ◽  
pp. 51-76 ◽  
Author(s):  
Bernd Steinbach ◽  
Christian Posthoff

The Boolean Differential Calculus (BDC) significantly extends the Boolean Algebra because not only Boolean values 0 and 1, but also changes of Boolean values or Boolean functions can be described. A Boolean Differential Equation (BDe) is a Boolean equation that includes derivative operations of the Boolean Differential Calculus. This paper aims at the classification of BDEs, the characterization of the respective solutions, algorithms to calculate the solution of a BDe, and selected applications. We will show that not only classes and arbitrary sets of Boolean functions but also lattices of Boolean functions can be expressed by Boolean Differential equations. In order to reach this aim, we give a short introduction into the BDC, emphasize the general difference between the solutions of a Boolean equation and a BDE, explain the core algorithms to solve a BDe that is restricted to all vectorial derivatives of f (x) and optionally contains Boolean variables. We explain formulas for transforming other derivative operations to vectorial derivatives in order to solve more general BDEs. New fields of applications for BDEs are simple and generalized lattices of Boolean functions. We describe the construction, simplification and solution. The basic operations of XBOOLE are sufficient to solve BDEs. We demonstrate how a XBooLe-problem program (PRP) of the freely available XBooLe-Monitor quickly solves some BDes.


1987 ◽  
Vol 21 (4) ◽  
pp. 287-305 ◽  
Author(s):  
Y. Crama ◽  
P. L. Hammer ◽  
B. Jaumard ◽  
B. Simeone

Author(s):  
Thomas Neele ◽  
Tim A. C. Willemse ◽  
Wieger Wesselink

Abstract Partial-order reduction (POR) is a well-established technique to combat the problem of state-space explosion. We propose POR techniques that are sound for parity games, a well-established formalism for solving a variety of decision problems. As a consequence, we obtain the first POR method that is sound for model checking for the full modal $$\mu $$-calculus. Our technique is applied to, and implemented for the fixed point logic called parameterised Boolean equation systems, which provides a high-level representation of parity games. Experiments indicate that substantial reductions can be achieved.


Sign in / Sign up

Export Citation Format

Share Document