Alternating automata, the weak monadic theory of the tree, and its complexity
International Colloquium on Automata, Languages and Programming on Automata, languages and programming
Journal of the ACM (JACM)
Theoretical Computer Science
An automata-theoretic approach to linear temporal logic
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Intractability of decision problems for finite-memory automata
Theoretical Computer Science - Special issue on universal machines and computations
Pushdown processes: games and model-checking
Information and Computation - Special issue on FLOC '96
Verifying lossy channel systems has nonprimitive recursive complexity
Information Processing Letters
Undecidable problems in unreliable computations
Theoretical Computer Science - Latin American theoretical informatics
First-order logic with two variables and unary temporal logic
Information and Computation - Special issue: LICS'97
Decidability of reachability in vector addition systems (Preliminary Version)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Finite state machines for strings over infinite alphabets
ACM Transactions on Computational Logic (TOCL)
Temporal Logic with Predicate "-Abstraction
TIME '05 Proceedings of the 12th International Symposium on Temporal Representation and Reasoning
Computation: finite and infinite machines
Computation: finite and infinite machines
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
On the freeze quantifier in Constraint LTL: Decidability and complexity
Information and Computation
FCT '07 Proceedings of the 16th international symposium on Fundamentals of Computation Theory
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
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
On metric temporal logic and faulty turing machines
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Automata and logics for words and trees over an infinite alphabet
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
The Power of Non-deterministic Reassignment in Infinite-Alphabet Pushdown Automata
Languages: From Formal to Natural
Static analysis of active XML systems
ACM Transactions on Database Systems (TODS)
Model checking memoryful linear-time logics over one-counter automata
Theoretical Computer Science
Safety alternating automata on data words
ACM Transactions on Computational Logic (TOCL)
Two-variable logic with two order relations
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the satisfiability of two-variable logic over data words
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Alternating automata on data trees and XPath satisfiability
ACM Transactions on Computational Logic (TOCL)
Efficient reasoning about data trees via integer linear programming
Proceedings of the 14th International Conference on Database Theory
Comparing workflow specification languages: a matter of views
Proceedings of the 14th International Conference on Database Theory
Two-variable logic and key constraints on data words
Proceedings of the 14th International Conference on Database Theory
Two-variable logic on data words
ACM Transactions on Computational Logic (TOCL)
An automaton over data words that captures EMSO logic
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Expressiveness of Hybrid Temporal Logic on Data Words
Electronic Notes in Theoretical Computer Science (ENTCS)
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Comparing workflow specification languages: A matter of views
ACM Transactions on Database Systems (TODS)
Foundations of XML based on logic and automata: a snapshot
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
Regular expressions for data words
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Feasible automata for two-variable logic with successor on data words
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Model checking languages of data words
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Regular path queries on graphs with data
Proceedings of the 15th International Conference on Database Theory
Efficient reasoning about data trees via integer linear programming
ACM Transactions on Database Systems (TODS)
An Automata Model for Trees with Ordered Data Values
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Decidability of Downward XPath
ACM Transactions on Computational Logic (TOCL)
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Verification of relational data-centric dynamic systems with external services
Proceedings of the 32nd symposium on Principles of database systems
Graph Reachability and Pebble Automata over Infinite Alphabets
ACM Transactions on Computational Logic (TOCL)
Extending two-variable logic on data trees with order on data values and its automata
ACM Transactions on Computational Logic (TOCL)
Computable fixpoints in well-structured symbolic model checking
Formal Methods in System Design
Adding an Equivalence Relation to the Interval Logic ABB: Complexity and Expressiveness
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
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.00 |
A data word is a sequence of pairs of a letter from a finite alphabet and an element from an infinite set, where the latter can only be compared for equality. To reason about data words, linear temporal logic is extended by the freeze quantifier, which stores the element at the current word position into a register, for equality comparisons deeper in the formula. By translations from the logic to alternating automata with registers and then to faulty counter automata whose counters may erroneously increase at any time, and from faulty and error-free counter automata to the logic, we obtain a complete complexity table for logical fragments defined by varying the set of temporal operators and the number of registers. In particular, the logic with future-time operators and 1 register is decidable but not primitive recursive over finite data words. Adding past-time operators or 1 more register, or switching to infinite data words, causes undecidability.