Model-checking of infinite graphs defined by graph grammars
暂无分享,去创建一个
[1] Bruno Courcelle,et al. Graph Rewriting: An Algebraic and Logic Approach , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.
[2] A. Tarski. A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .
[3] D. Kozen. Results on the Propositional µ-Calculus , 1982 .
[4] Ahmed Bouajjani,et al. Verification of Nonregular Temporal Properties for Context-Free Processes , 1994, CONCUR.
[5] David E. Muller,et al. The Theory of Ends, Pushdown Automata, and Second-Order Logic , 1985, Theor. Comput. Sci..
[6] Hardi Hungar,et al. Local Model-Checking for Context-Free Processes , 1993, Nord. J. Comput..