Satisfiability of \(\mathrm{ECTL}^*\) with local tree constraints

DOI10.1007/s00224-016-9724-yzbMath1435.03040OpenAlexW2568298848MaRDI QIDQ2411048

Markus Lohrey, Alexander Kartzow, Shiguang Feng, Claudia Carapelle

Publication date: 20 October 2017

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-016-9724-y

zbMATH Keywords

local constraintstemporal logicsordinal treesconcrete domains\(\mathrm{ECTL}^*\)EF-gamessemi-linear ordersWMSO+B

Mathematics Subject Classification ID

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

Related Items

Using model theory to find decidable and tractable description logics with concrete domains ⋮ Description logics with concrete domains and general concept inclusions revisited

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Satisfiability of \(\operatorname{ECTL}^\ast\) with constraints
• An automata-theoretic approach to constraint LTL
• 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
• LTL with the freeze quantifier and register automata
• Satisfiability of ECTL* with Tree Constraints
• Partially Ordered Sets with Transitive Automorphism Groups
• 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"
• Axiomatic Treatment of Rank in Infinite Sets
• Choice functions and Tychonoff’s theorem

This page was built for publication: Satisfiability of \(\mathrm{ECTL}^*\) with local tree constraints