Solving disjunctive/conjunctive boolean equation systems with alternating fixed points

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

Volumn 2988, Issue , 2004, Pages 436-450

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

^a AALTO UNIVERSITY   (Finland)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^c CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; TEMPORAL LOGIC;

BOOLEAN EQUATION SYSTEM; EQUATION SYSTEMS; FINITE-STATE CONCURRENT SYSTEM; FREE VARIABLE; ORDERS OF MAGNITUDE; RESOLUTION TECHNIQUES; TIME COMPLEXITY; VERIFICATION PROBLEMS;

BOOLEAN ALGEBRA;

EID: 35048865929     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24730-2_33     Document Type: Article

References (17)

1. H.R. Andersen. Model checking and boolean graphs. Theoretical Computer Science, 126:3-30, 1994.
2. A. Arnold and P. Crubille. A linear time algorithm to solve fixed-point equations on transition systems. Information Processing Letters, 29:57-66, 1988.
3. A. Arnold and D. Niwinski. Rudiments of μ-calculus. Studies in Logic and the foundations of mathematics. Volume 146, Elsevier, 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. G. Bhat and R. Cleaveland. Efficient local model-checking for fragments of the modal μ-calculus. In Proceedings of the Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, Lecture Notes in Computer Science 1055, pages 107-126, Springer Verlag 1996.
6. R. Cleaveland and B. Stoffen. Computing Behavioural relations logically. In proceedings of the 18 International Colloquium on Automata, Languages and Programming, Lecture Notes Computer Science 510, pages 127-138, Springer Verlag, 1991.
7. E.A. Emerson, C. Jutla and A.P. Sistla. On model checking for fragments of the μ-calculus. In C. Courcoubetis, editor, Fifth Internat. Conf. on Computer Aided Verification, Elounda, Greece, Lecture Notes in Computer Science 697, pages 385-396, Springer Verlag, 1993.
8. E. A. Emerson, C. Jutla, and A.P. Sistla. On model checking for the μ-calculus and its fragments. Theoretical Computer Science 258:491-522, 2001.
9. M. Jurdzinski. Deciding the winner in parity games is in UP⊆co-UP. Information Processing Letters, 68:119-124, 1998.
10. D. Kozen. Results on the propositional μ-calculus. Theoretical computer Science 27:333-354, 1983.
11. X. Liu, X, C.R. Ramakrishhan and S.A. Smolka. Fully Local and Efficient Evaluation of Alternating Fixed Points. In B. Steffen, editor, Proceedings of TACAS'98, Lecture Notes in Computer Science 1384, Springer Verlag, 1988.
12. A. Mader. Verification of Modal Properties using Boolean Equation Systems. PhD thesis, Technical University of Munich, 1997.
13. R. Mateescu. A Generic On-the-Fly Solver for Alternation-Free Boolean Equation Systems. Proceedings of the 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems TACAS'2003 (Warsaw, Poland), volume 2619 of Lecture Notes in Computer Science, pages 81-96. Springer Verlag, April 2003.
14. B. Stoffen, A. Classen, M. Klein, J. Knoop and T. Margaria. The fixpoint analysis machine. In I. Lee and S.A. Smolka, editors, Proceedings of the Sixth International Conference on Concurrency Theory (CONCUR '95), Lecture Notes in Computer Science 962, pages 72-87. Springer Verlag, 1995.
15. R. Tarjan. Depth-First Search and Linear Graph Algorithms. SIAM J. Computing, Vol. 1, No. 2, June 1972.
16. B. Vergauwen and J. Lewi. A linear algorithm for solving fixed-point equations on transition systems. In J.-C. Raoult, editor, CAAP'92, Lecture Notes Computer Science 581, pages 321-341, Springer Verlag, 1992.
17. B. Vergauwen and J. Lewi. Efficient Local Correctness Checking for Single and Alternating Boolean Equation Systems. In proc. of ICALP'94.