On temporal logics with data variable quantifications: decidability and complexity
From MaRDI portal
Recommendations
- Extending temporal logics with data variable quantifications
- Branching-Time Temporal Logic Extended with Qualitative Presburger Constraints
- Complexity and expressivity of branching- and alternating-time temporal logics with finitely many variables
- Temporal logics with local constraints (invited talk)
- Two-variable logic on data words
Cites work
- scientific article; zbMATH DE number 1614699 (Why is no real title available?)
- scientific article; zbMATH DE number 6109856 (Why is no real title available?)
- scientific article; zbMATH DE number 1834677 (Why is no real title available?)
- A Game-Theoretic Approach to Simulation of Data-Parameterized Systems
- A complete axiomatic characterization of first-order temporal logic of linear time
- A decidable extension of data automata
- Algorithmic analysis of array-accessing programs
- Alternating register automata on finite words and trees
- An automata-theoretic approach to branching-time model checking
- An automata-theoretic approach to constraint LTL
- An automata-theoretic approach to reasoning about parameterized systems and specifications
- An extension of data automata that captures XPath
- Automata, logics, and infinite games. A guide to current research
- Automated Reasoning
- Class counting automata on datawords
- Concerning the semantic consequence relation in first-order temporal logic
- Context-free languages over infinite alphabets
- Decidable fragments of first-order temporal logics
- Extending temporal logics with data variable quantifications
- Extending two-variable logic on data trees with order on data values and its automata
- Feasible automata for two-variable logic with successor on data words
- Finite-memory automata
- Finite-memory automata with non-deterministic reassignment
- Graph reachability and pebble automata over infinite alphabets
- Incompleteness of first-order temporal logic with until
- LTL model-checking for malware detection
- LTL with the freeze quantifier and register automata
- Mechanising first-order temporal resolution
- Model checking systems and specifications with parameterized atomic propositions
- Monodic temporal resolution
- On Reasoning About Rings
- On freeze LTL with ordered attributes
- On notions of regularity for data languages
- On pebble automata for data languages with decidable emptiness problem
- On the universal and existential fragments of the \(\mu\)-calculus
- Ordered navigation on multi-attributed data words
- Pushdown model checking for malware detection
- Reasoning about data repetitions with counter systems
- Reasoning about networks with many identical finite state processes
- Reasoning about systems with many processes
- Temporal logics on words with multiple data values
- Tools and algorithms for the construction and analysis of systems. 20th international conference, TACAS 2014, held as part of the European joint conferences on theory and practice of software, ETAPS 2014, Grenoble, France, April 5--13, 2014. Proceedings
- Two-variable logic on data words
- Using branching time temporal logic to synthesize synchronization skeletons
- Variable automata over infinite alphabets
Cited in
(5)
This page was built for publication: On temporal logics with data variable quantifications: decidability and complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342712)
