Theoretical Computer Science
Well-structured transition systems everywhere!
Theoretical Computer Science
Finite state machines for strings over infinite alphabets
ACM Transactions on Computational Logic (TOCL)
On the Freeze Quantifier in Constraint LTL: Decidability and Complexity
TIME '05 Proceedings of the 12th International Symposium on Temporal Representation and Reasoning
Temporal Logic with Predicate "-Abstraction
TIME '05 Proceedings of the 12th International Symposium on Temporal Representation and Reasoning
On the Decidability of Metric Temporal Logic
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Two-variable logic on data trees and XML reasoning
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Two-Variable Logic on Words with Data
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
LTL with the Freeze Quantifier and Register Automata
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Safety metric temporal logic is fully decidable
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
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)
Model checking memoryful linear-time logics over one-counter automata
Theoretical Computer Science
Model checking freeze LTL over one-counter automata
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Safety alternating automata on data words
ACM Transactions on Computational Logic (TOCL)
Alternating automata on data trees and XPath satisfiability
ACM Transactions on Computational Logic (TOCL)
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Model checking systems and specifications with parameterized atomic propositions
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
| Hi-index | 0.00 |
We consider the safety fragment of linear temporal logic with the freeze quantifier. The freeze quantifier is used to store a value from an infinite domain in a register for later comparison with other such values. We show that, for one register, satisfiability, refinement and model checking problems are decidable. The main result in the paper is that satisfiability is ExpSpace-complete. The proof of ExpSpace-membership involves a translation to a new class of faulty counter automata. We also show that refinement and model checking are not primitive recursive, and that dropping the safety restriction, adding past-time temporal operators, or adding one more register, each cause undecidability of all three decision problems.