Incremental model checking for decomposable structures

Extended abstract
  • J. A. Makowsky
  • E. V. Ravve
Contributed Papers Model Checking
Part of the Lecture Notes in Computer Science book series (LNCS, volume 969)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Cou93]
    B. Courcelle. The monadic second-order logic of graphs IX: Machines and their behaviours. Preprint, 1993.Google Scholar
  2. [Cou94]
    B. Courcelle. Monadic second order graph transductions: A survey. Theoretical Computer Science, 126:53–75, 1994.MathSciNetGoogle Scholar
  3. [CW95]
    B. Courcelle and I. Walukiewicz. Monadic second order logic, graphs and unfoldings of transition systems. Paper in preparation, 1995.Google Scholar
  4. [Dah82]
    E. Dahlhaus. Combinatorial and Logical Properties of Reductions to some Complete Problems in NP and NL. PhD thesis, Technische Universität Berlin, Germany, 1982.Google Scholar
  5. [EFT94]
    H.D. Ebbinghaus, J. Flum, and W. Thomas. Mathematical Logic, 3rd edition. Undergraduate Texts in Mathematics. Springer-Verlag, 1994.Google Scholar
  6. [Ehr61]
    A. Ehrenfeucht. An application of games to the completeness problem for formalized theories. Fundamenta Mathematicae, 49:129–141, 1961.Google Scholar
  7. [Eme90]
    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.Google Scholar
  8. [FV59]
    S. Feferman and R. Vaught. The first order properties of products of algebraic systems. Fundamenta Mathematicae, 47:57–103, 1959.Google Scholar
  9. [GL94]
    O. Grumberg and D.E. Long. Model checking and modular verification. ACM Trans. on Programming Languages and Systems, 16(3):843–871, 1994.CrossRefGoogle Scholar
  10. [Gur79]
    Y. Gurevich. Modest theory of short chains, I. Journal of Symbolic Logic, 44:481–490, 1979.Google Scholar
  11. [Imm87]
    N. Immerman. Languages that capture complexity classes. SIAM Journal on Computing, 16(4):760–778, Aug 1987.Google Scholar
  12. [Mak85]
    J.A. Makowsky. Compactness, embeddings and definability. In Model-Theoretic Logics, Perspectives in Mathematical Logic, chapter 18. Springer Verlag, 1985.Google Scholar
  13. [MR95a]
    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.Google Scholar
  14. [MR95b]
    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.Google Scholar
  15. [Rab65]
    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.Google Scholar
  16. [Rab69]
    M. Rabin. Decidability of second order theories and automata on infinite trees. Transactions of American Mathematical Society, 141:1–35, 1969.Google Scholar
  17. [She75]
    S. Shelah. The monadic theory of order. Annals of Mathematics, 102:379–419, 1975.Google Scholar
  18. [She92]
    S. Shelah. On the very weak 0–1 law for random graphs with orders. Preprint, 1992.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • J. A. Makowsky
    • 1
  • E. V. Ravve
    • 1
  1. 1.Department of Computer ScienceTechnion Israel Institute of TechnologyHaifaIsrael

Personalised recommendations