Satisfiability of CTL* with constraints

Authors:
Claudia Carapelle;Alexander Kartzow;Markus Lohrey
Affiliations:
Institut für Informatik, Universität Leipzig, Germany;Institut für Informatik, Universität Leipzig, Germany;Institut für Informatik, Universität Leipzig, Germany
Venue:
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Year:
2013

Citing 10
Cited 0

The monadic second-order logic of graphs V: on closing the gap between definability and recognizability

MFCS '89 Selected papers of the symposium on Mathematical foundations of computer science
Deciding Properties of Integral Relational Automata

ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Combining interval-based temporal reasoning with general TBoxes

Artificial Intelligence
NEXP TIME-complete description logics with concrete domains

ACM Transactions on Computational Logic (TOCL)
An automata-theoretic approach to constraint LTL

Information and Computation
A Tableau Algorithm for Description Logics with Concrete Domains and General TBoxes

Journal of Automated Reasoning
Verification of qualitative Z constraints

Theoretical Computer Science
An Automata-based Approach for CTL*; With Constraints

Electronic Notes in Theoretical Computer Science (ENTCS)
Regular Cost Functions over Finite Trees

LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
Branching-time temporal logic extended with qualitative presburger constraints

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that satisfiability for CTL* with equality-, order-, and modulo-constraints over ℤ is decidable. Previously, decidability was only known for certain fragments of CTL*, e.g., the existential and positive fragments and EF.