Satisfiability of ECTL* with Tree Constraints

DOI10.1007/978-3-319-20297-6_7zbMath1435.03039arXiv1412.2905OpenAlexW2963510243MaRDI QIDQ3194710

Shiguang Feng, Alexander Kartzow, Markus Lohrey, Claudia Carapelle

Publication date: 20 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1412.2905

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)

Related Items (4)

Satisfiability of \(\operatorname{ECTL}^\ast\) with constraints ⋮ Satisfiability of ECTL* with Tree Constraints ⋮ Satisfiability of \(\mathrm{ECTL}^*\) with local tree constraints ⋮ $$\mathbb {N}$$ -Memory Automata over the Alphabet $$\mathbb {N}$$

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Verification of qualitative \(\mathbb Z\) constraints
• Verification of gap-order constraint abstractions of counter systems
• Temporal logics on strings with prefix relation
• Satisfiability of CTL* with Constraints
• Satisfiability of ECTL* with Tree Constraints
• The Comparability Graph of a Tree
• An Automata-based Approach for CTL⋆ With Constraints
• Branching-Time Temporal Logic Extended with Qualitative Presburger Constraints
• A Note on "The Comparability Graph of a Tree"

This page was built for publication: Satisfiability of ECTL* with Tree Constraints