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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andersen, H.R.: Model checking and boolean graphs. Theoretical Computer Science 126, 3–30 (1994)
Arnold, A., Niwinski, D.: Rudiments of μ-calculus. Studies in logic and the foundations of mathematics, vol. 146. Elsevier, Amsterdam (2001)
Blom, S., Fokkink, W., Groote, J., van Langevelde, I., Lisser, B., van de Pol, J.: μCRL: a toolset for analysing algebraic specifications. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 250–254. Springer, Heidelberg (2001)
Bradfield, J., Stirling, C.: Modal Logics and mu-Calculi: An introduction. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of Process Algebra, ch. 4. Elsevier, Amsterdam (2001)
Groote, J.F., Keinänen, M.K.: Solving Disjunctive/Conjunctive Boolean Equation Systems with Alternating Fixed Points. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 436–450. Springer, Heidelberg (2004)
King, V., Kupferman, O., Vardi, M.Y.: On the complexity of parity word automata. In: Honsell, F., Miculan, M. (eds.) FOSSACS 2001. LNCS, vol. 2030, pp. 276–286. Springer, Heidelberg (2001)
Kozen, D.: Results on the propositional μ-calculus. Theoretical computer Science 27, 333–354 (1983)
Mader, A.: Verification of Modal Properties using Boolean Equation Systems. PhD thesis, Technical University of Munich (1997)
Mateescu, R.: A Generic On-the-Fly Solver for Alternation-Free Boolean Equation Systems. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 81–96. Springer, Heidelberg (2003)
Tanenbaum, A.: Computer Networks, 4th edn. Prentice Hall PTR, Englewood Cliffs (2003)
Tarjan, R.E.: Depth first search and linear graph algorithms. SIAM Journal of Computing 1(2), 146–160 (1972)
Tarjan, R.E.: A hierarchical clustering algorithm using strong components. Information Processing Letters 14(1), 26–29 (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Groote, J.F., Keinänen, M. (2005). A Sub-quadratic Algorithm for Conjunctive and Disjunctive Boolean Equation Systems. In: Van Hung, D., Wirsing, M. (eds) Theoretical Aspects of Computing – ICTAC 2005. ICTAC 2005. Lecture Notes in Computer Science, vol 3722. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11560647_35
Download citation
DOI: https://doi.org/10.1007/11560647_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29107-7
Online ISBN: 978-3-540-32072-2
eBook Packages: Computer ScienceComputer Science (R0)