Model-Checking of CTL on Infinite Kripke Structures Defined by Simple Graph Grammars
Résumé
We present an algorithm for checking whether an infinite transition system, defined by a graph grammar of a restricted kind, is a model of a formula of the temporal logic CTL. We first present the syntax and the semantics of CTL, that are defined with respect to transition systems, labelled with atomic propositions. Then, we show how to adapt the formalism of graph grammars, for expressing such infinite transition systems. Our algorithm treats such a finite representation, and modify it, ensuring that the labelling for formulas remains coherent with the truth values of the different states of the infinite transition system.