LTL Over integer periodicity constraints
Theoretical Computer Science
On the freeze quantifier in Constraint LTL: Decidability and complexity
Information and Computation
An automata-theoretic approach to constraint LTL
Information and Computation
A Decidable Temporal Logic of Repeating Values
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
LTL with the freeze quantifier and register automata
ACM Transactions on Computational Logic (TOCL)
On the Computational Power of Querying the History
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Counting Multiplicity over Infinite Alphabets
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
When model-checking freeze LTL over counter machines becomes decidable
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
On the Computational Power of Querying the History
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Reasoning about Data Repetitions with Counter Systems
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.01 |
A predicate linear temporal logic LTL_驴= without quantifiers but with predicate 驴-abstraction mechanism and equality is considered. The models of LTL_驴= can be naturally seen as the systems of pebbles (flexible constants) moving over the elements of some (possibly infinite) domain. This allows to use LTL_驴= for the specification of dynamicsystems using some resources, such as processes using memory locations, mobile agents occupying some sites, etc. On the other hand we show that LTL_驴= is not recursively axiomatizable and, therefore, fully automated verification of LTL_驴= specifications via validity checking is not, in general, possible. The result is based on computational universality of the above abstract computational model of pebble systems, which is of independent interest due to the range of possible interpretations of such systems.