Abstract
This paper examines FLC, which is the modal μ-calculus enriched with a sequential composition operator. Bisimulation invariance and the tree model property are proved. Its succinctness is compared to the modal μ-calculus. The main focus lies on FLC’s model checking problem over finite transition systems. It is proved to be Pspace-hard. A tableau model checker is given and an upper Exptime bound is derived from it. For a fixed alternation depth FLC’s model checking problem turns out to be Pspace-complete.
Chapter PDF
Similar content being viewed by others
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. Temporaland 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. Allen Emerson. Uniform inevitability is tree automaton inefiable. Information Processing Letters, 24(2):77–79, January 1987.
R. Goré. Tableau methods for modaland 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.
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.
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.
C. Stirling. Modaland temporal logics. In Handbook of Logic in Computer Science, volume 2 (Background: Computational Structures), pages 477–563. Clarendon Press, Oxford, 1992.
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., Stirling, C. (2002). Model Checking Fixed Point Logic with Chop. In: Nielsen, M., Engberg, U. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2002. Lecture Notes in Computer Science, vol 2303. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45931-6_18
Download citation
DOI: https://doi.org/10.1007/3-540-45931-6_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43366-8
Online ISBN: 978-3-540-45931-6
eBook Packages: Springer Book Archive