Logics of Repeating Values on Data Trees and Branching Counter Systems
From MaRDI portal
Publication:2988368
DOI10.1007/978-3-662-54458-7_12zbMath1486.68119OpenAlexW2612213744MaRDI QIDQ2988368
Sergio Abriola, Santiago Figueira, Diego Figueira
Publication date: 19 May 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-54458-7_12
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Data structures (68P05) Temporal logic (03B44) Computational aspects of satisfiability (68R07)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The covering and boundedness problems for vector addition systems
- The covering and boundedness problems for branching vector addition systems
- FO2(<,+1,~) on data trees, data tree automata and branching vector addition systems
- Alternating register automata on finite words and trees
- Model Checking Languages of Data Words
- Temporal Logics on Words with Multiple Data Values.
- Model Theory of XPath on Data Trees. Part I: Bisimulation and Characterization
- LTL with the freeze quantifier and register automata
- Alternating automata on data trees and XPath satisfiability
- Two-variable logic on data words
- Decidability of Downward XPath
- Nonelementary Complexities for Branching VASS, MELL, and Extensions
- Temporal Logics of Repeating Values
- Future-Looking Logics on Data Words and Trees
- Two-variable logic on data trees and XML reasoning
- Automata and Logics for Words and Trees over an Infinite Alphabet
- “Sometimes” and “not never” revisited
- Pattern logics and auxiliary relations
- Reasoning about Data Repetitions with Counter Systems
- Finite state machines for strings over infinite alphabets
- A Decidable Temporal Logic of Repeating Values
This page was built for publication: Logics of Repeating Values on Data Trees and Branching Counter Systems
