Title :
Monadic Chain Logic Over Iterations and Applications to Pushdown Systems
Author :
Kuske, Dietrich ; Lohrey, Markus
Author_Institution :
Inst. fur Informatik, Leipzig Univ.
Abstract :
Logical properties of iterations of relational structures are studied and these decidability results are applied to the model checking of a powerful extension of pushdown systems. It is shown that the monadic chain theory of the iteration of a structure A (in the sense of Shelah and Stupp) is decidable in case the first-order theory of the structure A is decidable. This result fails if Muchnik´s clone-predicate is added. A model of pushdown automata, where the stack alphabet is given by an arbitrary (possibly infinite) relational structure, is introduced. If the stack structure has a decidable first-order theory with regular reachability predicates, then the same holds for the configuration graph of this pushdown automaton. This result follows from our decidability result for the monadic chain theory of the iteration
Keywords :
decidability; formal verification; iterative methods; pushdown automata; reachability analysis; trees (mathematics); clone-predicate; configuration graph; decidability; first-order theory; logical properties; model checking; monadic chain logic; pushdown automata; pushdown systems; reachability predicates; relational structure iteration; stack structure; Automata; Binary trees; Cloning; Lab-on-a-chip; Logic; Periodic structures; Power system modeling; Tree data structures;
Conference_Titel :
Logic in Computer Science, 2006 21st Annual IEEE Symposium on
Conference_Location :
Seattle, WA
Print_ISBN :
0-7695-2631-4
DOI :
10.1109/LICS.2006.35
