Abstract
Assume we are given a transition system which is composed from several well identified components. We propose a method which allows us to reduce the model checking of Monadic Second Order formulas in the complex system to model checking of derived formulas in Monadic Second Order Logic in the components.
Partially supported by a grant of the French-Israeli Binational Foundation, by a grant of the German-Israeli Foundation, and by the Fund for Promotion of Research of the Technion-Israeli Institute of Technology.
This paper contains parts of the M.Sc. thesis of the second author, written under the supervision of the first author.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
B. Courcelle. The monadic second-order logic of graphs IX: Machines and their behaviours. Preprint, 1993.
B. Courcelle. Monadic second order graph transductions: A survey. Theoretical Computer Science, 126:53–75, 1994.
B. Courcelle and I. Walukiewicz. Monadic second order logic, graphs and unfoldings of transition systems. Paper in preparation, 1995.
E. Dahlhaus. Combinatorial and Logical Properties of Reductions to some Complete Problems in NP and NL. PhD thesis, Technische Universität Berlin, Germany, 1982.
H.D. Ebbinghaus, J. Flum, and W. Thomas. Mathematical Logic, 3rd edition. Undergraduate Texts in Mathematics. Springer-Verlag, 1994.
A. Ehrenfeucht. An application of games to the completeness problem for formalized theories. Fundamenta Mathematicae, 49:129–141, 1961.
E.A. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Hand-book of Theoretical Computer Science, volume 2, chapter 16. Elsevier Science Publishers, 1990.
S. Feferman and R. Vaught. The first order properties of products of algebraic systems. Fundamenta Mathematicae, 47:57–103, 1959.
O. Grumberg and D.E. Long. Model checking and modular verification. ACM Trans. on Programming Languages and Systems, 16(3):843–871, 1994.
Y. Gurevich. Modest theory of short chains, I. Journal of Symbolic Logic, 44:481–490, 1979.
N. Immerman. Languages that capture complexity classes. SIAM Journal on Computing, 16(4):760–778, Aug 1987.
J.A. Makowsky. Compactness, embeddings and definability. In Model-Theoretic Logics, Perspectives in Mathematical Logic, chapter 18. Springer Verlag, 1985.
J.A. Makowsky and E. Ravve. Incremental model checking for decomposable structures. Technical Report TR848, revised version, April 1995, Department of Computer Science, Technion-Israel Institute of Technology, Haifa, Israel, 1995.
J.A. Makowsky and E. Ravve. Incremental model checking for fixed point properties of decomposable structures. Technical Report TR844, revised version, April 1995, Department of Computer Science, Technion-Israel Institute of Technology, Haifa, Israel, 1995.
M.A. Rabin. A simple method for undecidability proofs and some applications. In Y. Bar Hillel, editor, Logic, Methodology and Philosophy of Science II, Studies in Logic, pages 58–68. North Holland, 1965.
M. Rabin. Decidability of second order theories and automata on infinite trees. Transactions of American Mathematical Society, 141:1–35, 1969.
S. Shelah. The monadic theory of order. Annals of Mathematics, 102:379–419, 1975.
S. Shelah. On the very weak 0–1 law for random graphs with orders. Preprint, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Makowsky, J.A., Ravve, E.V. (1995). Incremental model checking for decomposable structures. In: Wiedermann, J., Hájek, P. (eds) Mathematical Foundations of Computer Science 1995. MFCS 1995. Lecture Notes in Computer Science, vol 969. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60246-1_159
Download citation
DOI: https://doi.org/10.1007/3-540-60246-1_159
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60246-0
Online ISBN: 978-3-540-44768-9
eBook Packages: Springer Book Archive