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

J.F. Groote, M.K. Keinänen

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

5 Citations (Scopus)

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(e 2) 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.
Original languageEnglish
Title of host publicationTheoretical aspects of computing : second International colloquium, ICTAC 2005, Hanoi, Vietnam, October 17-21, 2005 : proceedings
EditorsD.V. Hung, M. Wirsing
Place of PublicationBerlin
PublisherSpringer
Pages532-545
ISBN (Print)3-540-29107-5
DOIs
Publication statusPublished - 2005

Publication series

NameLecture Notes in Computer Science
Volume3722
ISSN (Print)0302-9743

Fingerprint

Dive into the research topics of 'A sub-quadratic algorithm for conjunctive and disjunctive boolean equation systems'. Together they form a unique fingerprint.

Cite this