Ordered Navigation on Multi-attributed Data Words
From MaRDI portal
Publication:3190138
DOI10.1007/978-3-662-44584-6_34zbMath1417.68082arXiv1404.6064OpenAlexW1862276852MaRDI QIDQ3190138
Daniel Thoma, Peter Habermehl, Normann Decker, Martin Leucker
Publication date: 15 September 2014
Published in: CONCUR 2014 – Concurrency Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1404.6064
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Temporal logic (03B44)
Related Items (8)
On temporal logics with data variable quantifications: decidability and complexity ⋮ Two-Variable Separation Logic and Its Inner Circle ⋮ Unnamed Item ⋮ Leafy automata for higher-order concurrency ⋮ Unnamed Item ⋮ Weak and Nested Class Memory Automata ⋮ On Freeze LTL with Ordered Attributes ⋮ Abstraction refinement and antichains for trace inclusion of infinite state systems
This page was built for publication: Ordered Navigation on Multi-attributed Data Words
