Logic in Computer Science, Symposium on (2006)

Seattle, Washington

Aug. 12, 2006 to Aug. 15, 2006

ISSN: 1043-6871

ISBN: 0-7695-2631-4

pp: 91-100

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/LICS.2006.35

Markus Lohrey , Universitat Stuttgart, Germany

Dietrich Kuske , Universitat Leipzig, Germany

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.

INDEX TERMS

null

CITATION

Markus Lohrey,
Dietrich Kuske,
"Monadic Chain Logic Over Iterations and Applications to Pushdown Systems",

*Logic in Computer Science, Symposium on*, vol. 00, no. , pp. 91-100, 2006, doi:10.1109/LICS.2006.35