论文信息 - Incremental Model Checking for Decomposable Structures (Extended Abstract)

Incremental Model Checking for Decomposable Structures (Extended 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.

Johann A. Makowsky | Elena V. Ravve

[1] Bruno Courcelle,et al. The Monadic Second-Order Logic of Graphs IX: Machines and their Behaviours , 1995, Theor. Comput. Sci..

[2] Saharon Shelah. On the Very Weak 0-1 Law for Random Graphs with Orders , 1996, J. Log. Comput..

[3] Neil Immerman,et al. Languages that Capture Complexity Classes , 1987, SIAM J. Comput..

[4] Orna Grumberg,et al. Model checking and modular verification , 1994, TOPL.

[5] A. Ehrenfeucht. An application of games to the completeness problem for formalized theories , 1961 .

[6] Bruno Courcelle,et al. Monadic Second-Order Logic, Graphs and Unfoldings of Transition Systems , 1995 .

[7] S. Shelah. The monadic theory of order , 1975, 2305.00968.

[8] M. Rabin. Decidability of second-order theories and automata on infinite trees. , 1969 .

[9] Saharon Shelah,et al. Modest Theory of Short Chains. II , 1979, J. Symb. Log..

[10] E. Allen Emerson,et al. Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[11] Bruno Courcelle,et al. Monadic Second-Order Definable Graph Transductions: A Survey , 1994, Theor. Comput. Sci..

[12] S. Feferman,et al. The first order properties of products of algebraic systems , 1959 .