Sciweavers

Share
LICS
2006
IEEE

Monadic Chain Logic Over Iterations and Applications to Pushdown Systems

10 years 5 months ago
Monadic Chain Logic Over Iterations and Applications to Pushdown Systems
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.
Dietrich Kuske, Markus Lohrey
Added 12 Jun 2010
Updated 12 Jun 2010
Type Conference
Year 2006
Where LICS
Authors Dietrich Kuske, Markus Lohrey
Comments (0)
books