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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3722 LNCS, Issue , 2005, Pages 532-545

  Groote, Jan Friso ^a   Keinänen, Misa ^b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS;

CONJUNCTIVE BOOLEAN EQUATION SYSTEMS; DISJUNCTIVE BOOLEAN EQUATION SYSTEMS; FIXPOINT EXPRESSIONS; SUB-QUADRATIC ALGORITHMS;

QUADRATIC PROGRAMMING;

EID: 33646429463     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11560647_35     Document Type: Conference Paper

References (12)

1. H.R. Andersen, Model checking and boolean graphs. Theoretical Computer Science, 126 (1994) 3-30.
2. A. Arnold and D. Niwinski. Rudiments of μ-calculus, Studies in logic and the foundations of mathematics, 146. Elsevier, 2001.
3. S. Blom, W. Fokkink, J. Groote, I. van Langevelde, B. Lisser and J. van de Pol, μCRL: a toolset for analysing algebraic specifications. In Proceedings of the 13th Conference on Computer Aided Verification (CAV'2001), Paris, Lecture Notes in Computer Science 2102, pp. 250-254, Springer-Verlag, July 2001.
4. J. Bradfield and C. Stirling. Modal Logics and mu-Calculi: An introduction. Chapter 4 of Handbook of Process Algebra. J.A. Bergstra, A. Ponse and S.A. Smolka, editors. Elsevier, 2001.
5. J.F. Groote and M.K. Keinänen. Solving Disjunctive/Conjunctive Boolean Equation Systems with Alternating Fixed Points. In K. Jensen and A. Podelski, editors, Proc. 10th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'2004), volume 2988 of Lecture Notes in Computer Science, pages 436-450. Springer, 2004.
6. V. King, O. Kupferman and M.Y. Vardi. On the complexity of parity word automata. Proc. of 4th International Conference on Foundations of Software Science and Computation Structures, volume 2030 of Lecture Notes in Computer Science, pages 276-286. Springer, 2001.
7. D. Kozen. Results on the propositional μ-calculus. Theoretical computer Science 27 (1983) 333-354.
8. A. Mader. Verification of Modal Properties using Boolean Equation Systems. PhD thesis, Technical University of Munich, 1997.
9. R. Mateescu. A Generic On-the-Fly Solver for Alternation-Free Boolean Equation Systems. In Proceedings of Conf. on Tools and Algorithms for the Construction and Analysis of Systems, Lecture Notes in Computer Science 2619 (Springer Verlag, 2003) 81-96.
10. A. Tanenbaum. Computer Networks. Prentice Hall PTR, fourth edition, 2003.
11. R.E. Tarjan. Depth first search and linear graph algorithms. SIAM Journal of Computing. 1(2):146-160, 1972.
12. R.E. Tarjan. A hierarchical clustering algorithm using strong components. Information Processing Letters, 14(1):26-29, 1982.