“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
Theoretical Computer Science
An access control model supporting periodicity constraints and temporal reasoning
ACM Transactions on Database Systems (TODS)
Reversal-Bounded Multicounter Machines and Their Decision Problems
Journal of the ACM (JACM)
Well-structured transition systems everywhere!
Theoretical Computer Science
Decidability of model checking with the temporal logic EF
Theoretical Computer Science
Undecidable Verification Problems for Programs with Unreliable Channels
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Deciding Properties of Integral Relational Automata
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
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
Calendars, Time Granularities, and Automata
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Multiple Counters Automata, Safety Analysis and Presburger Arithmetic
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
On the Verification Problem of Nonregular Properties for Nonregular Processes
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
General decidability theorems for infinite-state systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
NEXP TIME-complete description logics with concrete domains
ACM Transactions on Computational Logic (TOCL)
Computation: finite and infinite machines
Computation: finite and infinite machines
Verification of qualitative constraints
CONCUR 2005 - Concurrency Theory
Analysis of modular arithmetic
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
An automata-theoretic approach to constraint LTL
Information and Computation
Verification of gap-order constraint abstractions of counter systems
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Satisfiability of CTL* with constraints
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Verification of gap-order constraint abstractions of counter systems
Theoretical Computer Science
| Hi-index | 0.00 |
Recently, LTL extended with atomic formulas built over a constraint language interpreting variables in ℤ has been shown to have a decidable satisfiability and model-checking problem. This language allows to compare the variables at different states of the model and include periodicity constraints, comparison constraints, and a restricted form of quantification. On the other hand, the CTL counterpart of this logic (and hence also its CTL* counterpart which subsumes both LTL and CTL) has an undecidable model-checking problem. In this paper, we substantially extend the decidability border, by considering a meaningful fragment of CTL* extended with such constraints (which subsumes both the universal and existential fragments, as well as the EF-like fragment) and show that satisfiability and model-checking over relational automata that are abstraction of counter machines are decidable. The correctness and the termination of our algorithm rely on a suitable well quasi-ordering defined over the set of variable valuations.