On Freeze LTL with Ordered Attributes
From MaRDI portal
Publication:2811345
DOI10.1007/978-3-662-49630-5_16zbMath1475.68179arXiv1504.06355OpenAlexW825655794MaRDI QIDQ2811345
Publication date: 10 June 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.06355
Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Related Items (5)
On temporal logics with data variable quantifications: decidability and complexity ⋮ The ideal view on Rackoff's coverability technique ⋮ The Parametric Complexity of Lossy Counter Machines ⋮ Complexity Hierarchies beyond Elementary ⋮ Consistently-detecting monitors
Cites Work
- Unnamed Item
- Ordinal recursive complexity of unordered data nets
- Hierarchies of modal and temporal logics with reference pointers
- Alternating register automata on finite words and trees
- Temporal Logics on Words with Multiple Data Values.
- LTL with the freeze quantifier and register automata
- Two-variable logic on data words
- Ordered Navigation on Multi-attributed Data Words
- Shuffle Expressions and Words with Nested Data
- Mixing Lossy and Perfect Fifo Channels
- Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets
- A really temporal logic
- Demystifying Reachability in Vector Addition Systems
- Modal Logics Between Propositional and First-order
- Reasoning about Data Repetitions with Counter Systems
- Safely Freezing LTL
- The Power of Priority Channel Systems
This page was built for publication: On Freeze LTL with Ordered Attributes