Abstract
The logic considered in this paper is FLC, fixed point logic with chop. It is an extension of modal μ-calculus L μ that is capable of defining non-regular properties which makes it interesting for verification purposes. Its model checking problem over finite transition systems is PSPACE-hard. We define games that characterise FLC’s model checking problem over arbitrary transition systems. Over finite transition systems they can be used as a basis of a local model checker for FLC. I.e. the games allow the transition system to be constructed on-the- fly. On formulas with fixed alternation depth and so-called sequential depth deciding the winner of the games is PSPACE-complete. The best upper bound for the general case is EXPSPACE which can be improved to EXPTIME at the cost of losing the locality property. On Lμ formulas the games behave equally well as the model checking games for Lμ, i.e. deciding the winner is in NP蝅co-NP.
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
A. K. Chandra, D. C. Kozen, and L. J. Stockmeyer. Alternation. Journal of the ACM, 28(1):114–133, January 1981.
E. A. Emerson. Temporal and modal logic. 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.
E. A. Emerson, C. S. Jutla, and A. P. Sistla. On model checking for the μ-calculus and its fragments. Theoretical Computer Science, 258(1–3):491–522, 2001.
E. P. Friedman. The inclusion problem for simple languages. TCS, 1(4):297–316, April 1976.
R. Goré. Tableau methods for modal and temporal logics. In M. D'Agostino, D. Gabbay, R. Hähnle, and J. Posegga, editors, Handbook of Tableau Methods. Kluwer, Dordrecht, 1999.
J. F. Groote and H. Hüttel. Undecidable equivalences for basic process algebra. Information and Computation, 115(2):354–371, December 1994.
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.
D. Kozen. Results on the propositional mu-calculus. TCS, 27:333–354, December 1983.
M. Lange and C. Stirling. Model checking fixed point logic with chop. In M. Nielsen and U. H. Engberg, editors, Proc. Foundations of Software Science and Computation Structures, FOSSACS’02, volume 2303 of LNCS, pages 250–263, Grenoble, France, 2002. Springer.
M. M:uller-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.
C. Stirling. Modal and temporal logics. In Handbook of Logic in Computer Science, volume 2 (Background: Computational Structures), pages 477–563. Clarendon Press, Oxford, 1992.
C. Stirling. Local model checking games. In I. Lee and S. A. Smolka, editors, Proc. 6th Int. Conf. on Concurrency Theory, CONCUR’95, volume 962 of LNCS, pages 1–11, Berlin, Germany, August 1995. Springer.
A. Tarski. A lattice-theoretical fixpoint theorem and its application. Pacific J.Math., 5:285–309, 1955.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lange, M. (2002). Local Model Checking Games for Fixed Point Logic with Chop. In: Brim, L., Křetínský, M., Kučera, A., Jančar, P. (eds) CONCUR 2002 — Concurrency Theory. CONCUR 2002. Lecture Notes in Computer Science, vol 2421. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45694-5_17
Download citation
DOI: https://doi.org/10.1007/3-540-45694-5_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44043-7
Online ISBN: 978-3-540-45694-0
eBook Packages: Springer Book Archive