A sub-quadratic algorithm for conjunctive and disjunctive boolean equation systems

Authors:
Jan Friso Groote;Misa Keinänen
Affiliations:
Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands;Laboratory for Theoretical Computer Science, Department of Computer Science and Engineering, Helsinki University of Technology, Finland
Venue:
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Year:
2005

Citing 5
Cited 2

Model checking and boolean graphs

Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
Computer Networks

Computer Networks
On the Complexity of Parity Word Automata

FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
µCRL: A Toolset for Analysing Algebraic Specifications

CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
A generic on-the-fly solver for alternation-free boolean equation systems

TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems

Performance guarantees for distributed reachability queries

Proceedings of the VLDB Endowment
Proof graphs for parameterised boolean equation systems

CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new algorithm for conjunctive and disjunctive boolean equation systems which arise frequently in the verification and analysis of finite state concurrent systems. In contrast to the previously known O(e2) time algorithms, our algorithm computes the solution to such a fixpoint equation system with size e and alternation depth d in O(e log d) time (here d e). We show the correctness and complexity of the algorithm. We discuss heuristics and describe how the algorithm can be efficiently implemented. The algorithm is compared to a previous solution via experiments on verification examples. Our measurements indicate that the new algorithm makes the verification of a large class of fixpoint expressions more tractable.