Satisfiability of ECTL* with Tree Constraints

@article{Carapelle2015SatisfiabilityOE,
  title={Satisfiability of ECTL* with Tree Constraints},
  author={Claudia Carapelle and Shiguang Feng and Alexander Kartzow and M. Lohrey},
  journal={ArXiv},
  year={2015},
  volume={abs/1412.2905}
}
Recently, we have shown that satisfiability for $\mathsf{ECTL}^*$ with constraints over $\mathbb{Z}$ is decidable using a new technique. This approach reduces the satisfiability problem of $\mathsf{ECTL}^*$ with constraints over some structure A (or class of structures) to the problem whether A has a certain model theoretic property that we called EHD (for "existence of homomorphisms is decidable"). Here we apply this approach to concrete domains that are tree-like and obtain several results… Expand
Satisfiability of ECTL∗ with Local Tree Constraints
Satisfiability of ECTL⁎ with constraints
Temporal logics on strings with prefix relation
Model Checking Constraint LTL over Trees
N-Memory Automata over the Alphabet N
Playing Games in the Baire Space
Satisfiability of CTL* with Constraints
...
1
2
...

References

SHOWING 1-10 OF 22 REFERENCES
An Automata-based Approach for CTL* With Constraints
  • R. Gascon
  • Computer Science, Mathematics
  • INFINITY
  • 2009
On the Decidability of MSO+U on Infinite Trees
On Finite Model Theory
Verification of gap-order constraint abstractions of counter systems
Computation tree logic and regular omega-languages
  • W. Thomas
  • Mathematics, Computer Science
  • REX Workshop
  • 1988
Yet Another Process Logic (Preliminary Version)
Satisfiability of CTL* with Constraints
...
1
2
3
...