Structural Analysis of Boolean Equation Systems

We analyze 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 analyze 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 minimization of its structure graph.

[1]  Gordon D. Plotkin,et al.  A structural approach to operational semantics , 2004, J. Log. Algebraic Methods Program..

[2]  Scott A. Smolka,et al.  Simple Linear-Time Algorithms for Minimal Fixed Points (Extended Abstract) , 1998, ICALP.

[3]  C. Stirling.  Bisimulation , Model Checking and Other Games , 2009 .

[4]  Jaco van de Pol,et al.  Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems , 2007, CONCUR.

[5]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[6]  Michel A. Reniers,et al.  Analysis of Boolean Equation Systems through Structure Graphs , 2010, SOS.

[7]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[8]  Radu Mateescu,et al.  CAESAR_SOLVE: A generic library for on-the-fly resolution of alternation-free Boolean equation systems , 2006, International Journal on Software Tools for Technology Transfer.

[9]  Radu Mateescu,et al.  A Generic On-the-Fly Solver for Alternation-Free Boolean Equation Systems , 2003, TACAS.

[10]  Sven Schewe.  Solving Parity Games in Big Steps , 2007, FSTTCS.

[11]  Jan Friso Groote,et al.  Transition System Specifications with Negative Premises , 1993, Theor. Comput. Sci..

[12]  Henrik Reif Andersen.  Model Checking and Boolean Graphs , 1992, ESOP.

[13]  Perdita Stevens,et al.  Practical Model-Checking Using Games , 1998, TACAS.

[14]  Misa Keinänen,et al.  SOLVING BOOLEAN EQUATION SYSTEMS , 2005 .

[15]  Radu Mateescu,et al.  CADP 2006: A Toolbox for the Construction and Analysis of Distributed Processes , 2007, CAV.

[16]  Misa Keinänen.  Techniques for solving Boolean equation systems , 2006 .

[17]  Colin Stirling,et al.  Modal Logics and mu-Calculi: An Introduction , 2001, Handbook of Process Algebra.

[18]  Jan Friso Groote,et al.  Analysis of distributed systems with mCRL2 , 2008 .

[19]  C. R. Ramakrishnan,et al.  Fully Local and Efficient Evaluation of Alternating Fixed Points (Extended Abstract) , 1998, TACAS.

[20]  Thomas Wilke,et al.  Simulation Relations for Alternating Parity Automata and Parity Games , 2006, Developments in Language Theory.

[21]  Paul Crubillé,et al.  A Linear Algorithm to Solve Fixed-Point Equations on Transition Systems , 1988, Inf. Process. Lett..

[22]  Wieslaw Zielonka,et al.  Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees , 1998, Theor. Comput. Sci..

[23]  Jan Friso Groote,et al.  Parameterised boolean equation systems , 2005, Theor. Comput. Sci..

[24]  Dexter Kozen,et al.  RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .

[25]  Tim A. C. Willemse,et al.  Consistent Correlations for Parameterised Boolean Equation Systems with Applications in Correctness Proofs for Manipulations , 2010, CONCUR.

[26]  Jeroen Keiren,et al.  Bisimulation Minimisations for Boolean Equation Systems , 2009, Haifa Verification Conference.

[27]  Dexter Kozen,et al.  Results on the Propositional µ-Calculus , 1982, ICALP.

[28]  Marcin Jurdziński,et al.  Deciding the Winner in Parity Games is in UP \cap co-Up , 1998, Inf. Process. Lett..

[29]  Jan Friso Groote,et al.  Switching Graphs , 2008, Electron. Notes Theor. Comput. Sci..

[30]  Angelika Mader,et al.  Verification of modal properties using Boolean equation systems , 1997 .

[31]  Kim G. Larsen,et al.  Efficient Local Correctness Checking , 1992, CAV.

[32]  Jan Friso Groote,et al.  Notions of bisimulation and congruence formats for SOS with data , 2005, Inf. Comput..

[33]  Jan Friso Groote,et al.  Model-checking processes with data , 2005, Sci. Comput. Program..