Fast and simple nested fixpoints

Information Processing Letters

Volumn 59, Issue 6, 1996, Pages 303-308

  Seidl, Helmut ^a  

^a UNIVERSITY OF TRIER   (Germany)

Author keywords

Evaluation of fixpoint expressions; Hierarchical systems of equations; Model checking

Indexed keywords

COMPUTATIONAL COMPLEXITY; ITERATIVE METHODS; THEOREM PROVING;

ALTERNATION DEPTH; NESTED FIXPOINT EXPRESSIONS;

COMPUTATIONAL LINGUISTICS;

EID: 0030232397     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(96)00130-5     Document Type: Article

References (16)

1. H.R. Andersen, Model checking and Boolean graphs, Theoret. Comput. Sci. 126 (1) (1994) 3-30.
2. A. Arnold and P. Crubille, A linear time algorithm for solving fixpoint equations on transition systems, Inform. Process. Lett. 29 (1988) 57-66.
3. O. Bernholtz, M.V. Vardi and P. Wolper, An automatatheoretic approach to branching-time model checking (extended abstract), in: Proc. 6th Conf. on Computer Aided Verification, Lecture Notes on Computer Science 818 (Springer, Berlin, 1994) 142-155.
4. G. Bhat and R. Cleaveland, Efficient local model checking for fragments of the modal μ-calculus, in: Proc. Tools and Algorithms for the Construction and Analysis of Systems, Lecture Notes on Computer Science 1055 (Springer, Berlin, 1996) 107-126.
5. 20 states and beyond, Inform. and Comput. 98 (1992) 142-170.
6. R. Cleaveland and B. Steffen, A linear time model checking algorithm for the alternation-free modal μ-calculus, Formal Methods in System Design 2 (1993) 121-147.
7. R. Cleaveland, M. Klein and B. Steffen, Faster model checking for the modal μ-calculus, in: Proc. 4th Conf. on Computer Aided Verification, Lecture Notes on Computer Science 663 (Springer, Berlin, 1992) 410-422.
8. E.A. Emerson and C.-L. Lei, Efficient model checking in fragments of the propositional μ-calculus, in: Proc. 1st IEEE Symp. on Logic in Computer Science (1986) 267-278.
9. E.A. Emerson, C.S. Jutla and A.P. Sistla, On model-checking for fragments of μ-calculus, in: Proc. 5th Conf. on Computer Aided Verification, Lecture Notes on Computer Science 697 (Springer, Berlin, 1993) 385-396.
10. C. Fecht and H. Seidl, An even faster solver for general systems of equations, Tech. Rept. 96-11, Trier, 1996; also in: Proc. 3rd Int. Static Analysis Symposium (1996), to appear.
11. C. Fecht and H. Seidl, An even faster solver for general systems of equations, Tech. Rept. 96-11, Trier, 1996; also in: Proc. 3rd Int. Static Analysis Symposium (1996), to appear.
12. D. Kozen, Results on the propositional μ-calculus, Theoret. Comput. Sci. 27 (1983) 333-354.
13. D.E. Long, A. Browne, E.M. Clarke, S. Jha and W.R. Marrero, An improved algorithm for the evaluation of fixpoint expressions, in: Proc. 6th Conf. on Computer Aided Verification, Lecture Notes on Computer Science 818 (Springer, Berlin, 1994) 338-350.
14. C. Stirling, Modal and temporal logics, in: S. Abramsky, D. Gabbay and T. Maibaum, eds., Handbook of Logic in Computer Science (1992) 477-563.
15. M.Y. Vardi, A temporal fixpoint calculus. in: Proc. 15th Internat. Conf. on Principles of Programming Languages (1988) 250-259.
16. M.Y. Vardi and P. Wolper, Automata-theoretic techniques for modal logics of programs, J. Comput. System Sci. 32 (1986) 183-221.