Model checking fixed point logic with chop

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

Volumn 2303, Issue , 2002, Pages 250-263

  Lange, Martin ^a   Stirling, Colin ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTATION THEORY; TEMPORAL LOGIC;

BISIMULATIONS; FIXED-POINT LOGIC; MODAL MU CALCULUS; MODEL CHECKER; PSPACE-COMPLETE; SEQUENTIAL COMPOSITIONS; TRANSITION SYSTEM; TREE MODELING;

MODEL CHECKING;

EID: 23044532098     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-45931-6_18     Document Type: Article

References (11)

1. A. K. Chandra, D. C. Kozen, and L. J. Stockmeyer. Alternation. Journal of the ACM, 28(1):114-133, January 1981.
2. E. A. Emerson. Temporaland modall ogic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, chapter 14, pages 996-1072. Elsevier Science Publishers B.V.: Amsterdam, The Netherlands, New York, N.Y., 1990.
3. E. Allen Emerson. Uniform inevitability is tree automaton ineffable. Information Processing Letters, 24(2):77-79, January 1987.
4. R. Goré. Tableau methods for modaland temporall ogics. In M. D’Agostino, D. Gabbay, R. Hähnle, and J. Posegga, editors, Handbook of Tableau Methods. Kluwer, Dordrecht, 1999.
5. J. F. Groote and H. Hüttel. Undecidable equivalences for basic process algebra. Information and Computation, 115(2):354-371, December 1994.
6. D. Janin and I. Walukiewicz. On the expressive completeness of the propositional μ-calculus with respect to monadic second order logic. In U. Montanari and V. Sassone, editors, CONCUR’96: Concurrency Theory, 7th Int. Conf., volume 1119 of LNCS, pages 263-277, Pisa, Italy, 26-29 August 1996. Springer.
7. D. Kozen. Results on the propositional mu-calculus. TCS, 27:333-354, December 1983.
8. A. R. Meyer and L. J. Stockmeyer. Word problems requiring exponential time. In ACM Symp. on Theory of Computing (STOC’73), pages 1-9, New York, April 1973. ACM Press.
9. M. Müller-Olm. A modal fixpoint logic with chop. In C. Meinel and S. Tison, editors, Proc. 16th Annual Symp. on Theoretical Aspects of Computer Science, STACS’99, volume 1563 of LNCS, pages 510-520, Trier, Germany, 1999. Springer.
10. C. Stirling. Modaland temporall ogics. In Handbook of Logic in Computer Science, volume 2 (Background: Computational Structures), pages 477-563. Clarendon Press, Oxford, 1992.
11. A. Tarski. A lattice-theoretical fixpoint theorem and its application. Pacific J.Math., 5:285-309, 1955.