Theoretical Computer Science
Reasoning about infinite computations
Information and Computation
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
Deciding Properties of Integral Relational Automata
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
FroCoS '02 Proceedings of the 4th International Workshop on Frontiers of Combining Systems
An Automata-Theoretic Approach to Constraint LTL
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Symbolic Model Checking of Real-Time Systems
TIME '01 Proceedings of the Eighth International Symposium on Temporal Representation and Reasoning (TIME'01)
Model checking LTL with regular valuations for pushdown systems
Information and Computation - TACS 2001
Verification of qualitative constraints
CONCUR 2005 - Concurrency Theory
The Effects of Bounding Syntactic Resources on Presburger LTL
TIME '07 Proceedings of the 14th International Symposium on Temporal Representation and Reasoning
Reasoning About Sequences of Memory States
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Towards a model-checker for counter systems
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Satisfiability of CTL* with constraints
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
| Hi-index | 0.00 |
We introduce a general definition for a family of branching-time logics that extend CTL* by allowing constraints between variables at the atomic level. These constraints allow to compare values of variables at different states of the model. We define an automata-theoretic approach to solve verification problems for such extensions. Our method is based on a finite abstraction of the infinite state space and a symbolic representation of the models that generalizes several approaches used for extensions of the linear-time logic LTL with constraints. We extend and combine several constructions involving alternating tree automata. We apply this approach to prove decidability and optimal complexity results for particular instances of CTL* extensions whenever an abstraction of the models verifying a ''nice'' property can be computed. These theoretical results generalize several results on LTL with constraints where such nice abstractions are used.