62 search results - page 1 / 13 » Model Transformations in Decidability Proofs for Monadic The... |
CSL
2008
Springer
13 years 6 months ago
2008
Springer
We survey two basic techniques for showing that the monadic second-order theory of a structure is decidable. In the first approach, one deals with finite fragments of the theory (g...
LOPSTR
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL∗ ) properties of finite state reactive systems. The finite state ...
IANDC
2007
13 years 4 months ago
2007
A fundamental result of Büchi states that the set of monadic second-order formulas true in the structure (Nat, <) is decidable. A natural question is: what monadic predicates ...
FSTTCS
2009
Springer
13 years 11 months ago
2009
Springer
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given ...
LICS
2006
IEEE
13 years 10 months ago
2006
IEEE
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....