Undecidability of bisimilarity for Petri nets and some related problems
STACS '94 Selected papers of the eleventh symposium on Theoretical aspects of computer science
A logical characterization of data languages
Information Processing Letters
Temporal Logic with Forgettable Past
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Decidability and Complexity of Petri Net Problems - An Introduction
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
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
Memoryful Branching-Time Logic
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
LTL with the freeze quantifier and register automata
ACM Transactions on Computational Logic (TOCL)
Future-Looking Logics on Data Words and Trees
MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009
Counting Multiplicity over Infinite Alphabets
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
An Extension of Data Automata that Captures XPath
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
Vector addition system reachability problem: a short self-contained proof
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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)
A Decidable Two-Way Logic on Data Words
LICS '11 Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in 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
Model checking languages of data words
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Temporal Logics of Repeating Values
Journal of Logic and Computation
| Hi-index | 0.00 |
We study linear-time temporal logics interpreted over data words with multiple attributes. We restrict the atomic formulas to equalities of attribute values in successive positions and to repetitions of attribute values in the future or past. We demonstrate correspondences between satisfiability problems for logics and reach ability-like decision problems for counter systems. We show that allowing/disallowing atomic formulas expressing repetitions of values in the past corresponds to the reachability/coverability problem in Petri nets. This gives us 2EXPSPACE upper bounds for several satisfiability problems. We prove matching lower bounds by reduction from a reach ability problem for a newly introduced class of counter systems. This new class is a succinct version of vector addition systems with states in which counters are accessed via pointers, a potentially useful feature in other contexts. We strengthen further the correspondences between data logics and counter systems by characterizing the complexity of fragments, extensions and variants of the logic. For instance, we precisely characterize the relationship between the number of attributes allowed in the logic and the number of counters needed in the counter system.