An automata-theoretic approach to constraint LTL
Information and Computation
Static analysis of XML processing with data values
ACM SIGMOD Record
Static analysis of active XML systems
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A Decidable Temporal Logic of Repeating Values
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Complexity of Data Tree Patterns over XML Documents
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
LTL with the freeze quantifier and register automata
ACM Transactions on Computational Logic (TOCL)
Automatic verification of database-driven systems: a new frontier
Proceedings of the 12th International Conference on Database Theory
Automatic verification of data-centric business processes
Proceedings of the 12th International Conference on Database Theory
Two-variable logic on data trees and XML reasoning
Journal of the ACM (JACM)
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Branching-Time Logics Repeatedly Referring to States
Journal of Logic, Language and Information
Counting Multiplicity over Infinite Alphabets
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
On notions of regularity for data languages
Theoretical Computer Science
A generic framework for reasoning about dynamic networks of infinite-state processes
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Post embedding problem is not primitive recursive, with applications to channel systems
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
The ω-regular post embedding problem
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
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
Forward-XPath and extended register automata on data-trees
Proceedings of the 13th International Conference on Database Theory
Algorithmic analysis of array-accessing programs
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
On pebble automata for data languages with decidable emptiness problem
Journal of Computer and System Sciences
Lossy counter machines decidability cheat sheet
RP'10 Proceedings of the 4th international conference on Reachability problems
Revisiting Ackermann-hardness for lossy counter machines and reset Petri nets
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Artifact systems with data dependencies and arithmetic
Proceedings of the 14th International Conference on Database Theory
Automatic verification of data-centric business processes
BPM'11 Proceedings of the 9th international conference on Business process management
Expressiveness of Hybrid Temporal Logic on Data Words
Electronic Notes in Theoretical Computer Science (ENTCS)
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Automata and logics for words and trees over an infinite alphabet
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Algorithmic analysis of array-accessing programs
ACM Transactions on Computational Logic (TOCL)
Artifact systems with data dependencies and arithmetic
ACM Transactions on Database Systems (TODS)
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
On notions of regularity for data languages
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Shuffle expressions and words with nested data
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Verification of database-driven systems via amalgamation
Proceedings of the 32nd symposium on Principles of database systems
Foundations of data-aware process analysis: a database theory perspective
Proceedings of the 32nd symposium on Principles of database systems
Hi-index | 0.00 |
Temporal logics, first-order logics, and automata over data words have recently attracted considerable attention. A data word is a word over a finite alphabet, together with a datum (an element of an infinite domain) at each position. Examples include timed words and XML documents. To refer to the data, temporal logics are extended with the freeze quantifier, first-order logics with predicates over the data domain, and automata with registers or pebbles. We investigate relative expressiveness and complexity of standard decision problems for LTL with the freeze quantifier (LTL芦), 2-variable first-order logic (FO2) over data words, and register automata. The only predicate available on data is equality. Previously undiscovered connections among those formalisms, and to counter automata with incrementing errors, enable us to answer several questions left open in recent literature. We show that the future-time fragment of LTL芦 which corresponds to FO2 over finite data words can be extended considerably while preserving decidability, but at the expense of non-primitive recursive complexity, and that most of further extensions are undecidable. We also prove that surprisingly, over infinite data words, LTL芦 without the 'unti' operator, as well as nonemptiness of one-way universal register automata, are undecidable even when there is only 1 register.