Satisfiability of ECTL^* with local tree constraints

DOI10.1007/S00224-016-9724-YMaRDI QIDQ2411048zbMATH OpenOpenAlexFDO

Authors Claudia Carapelle, Shiguang Feng, Alexander Kartzow, Markus Lohrey

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

\(\mathrm{ECTL}^*\)concrete domainsEF-gameslocal constraintsordinal treessemi-linear orderstemporal logicsWMSO+B

Mathematics Subject Classification ID

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

Recommendations

• Satisfiability of \(\mathsf {ECTL}^*\) with tree constraints
• Satisfiability of \(\operatorname{ECTL}^\ast\) with constraints
• CTL^ with graded path modalities
• Satisfiability of \(\mathrm{CTL}^{*}\) with constraints
• Temporal logics with local constraints (invited talk)

Cites work

• A Note on "The Comparability Graph of a Tree"
• An automata-based approach for \(\text{CTL}^{*}\) with constraints
• An automata-theoretic approach to constraint LTL
• Axiomatic Treatment of Rank in Infinite Sets
• Branching-Time Temporal Logic Extended with Qualitative Presburger Constraints
• Choice functions and Tychonoff’s theorem
• scientific article; zbMATH DE number 3876574 (Why is no real title available?)
• scientific article; zbMATH DE number 6829362 (Why is no real title available?)
• scientific article; zbMATH DE number 803291 (Why is no real title available?)
• LTL with the freeze quantifier and register automata
• Partially Ordered Sets with Transitive Automorphism Groups
• Satisfiability of \(\mathrm{CTL}^{*}\) with constraints
• Satisfiability of \(\mathsf {ECTL}^*\) with tree constraints
• Satisfiability of \(\operatorname{ECTL}^\ast\) with constraints
• Temporal logics on strings with prefix relation
• The Comparability Graph of a Tree
• Verification of gap-order constraint abstractions of counter systems
• Verification of qualitative \(\mathbb Z\) constraints
• Weak \(\text{MSO}+U\) over infinite trees

Cited in

(7)

• Using model theory to find decidable and tractable description logics with concrete domains
• Description logics with concrete domains and general concept inclusions revisited
• Satisfiability of \(\operatorname{ECTL}^\ast\) with constraints
• Satisfiability of \(\mathrm{CTL}^{*}\) with constraints
• Satisfiability of \(\mathsf {ECTL}^*\) with tree constraints
• First steps towards taming description logics with strings
• Reachability and bounded emptiness problems of constraint automata with prefix, suffix and infix

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2411048)