Playing with Repetitions in Data Words Using Energy Games
From MaRDI portal
Publication:3300789
DOI10.1145/3209108.3209154zbMath1497.91007arXiv1802.07435OpenAlexW2962707881MaRDI QIDQ3300789
Diego Figueira, M. Praveen, Anirban Majumdar
Publication date: 30 July 2020
Published in: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1802.07435
2-person games (91A05) Logic in computer science (03B70) Decidability of theories and sets of sentences (03B25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (4)
Church synthesis on register automata over linearly ordered data domains ⋮ Realizability problem for constraint LTL ⋮ Synthesis of Data Word Transducers ⋮ Playing with Repetitions in Data Words Using Energy Games
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Undecidable problems in unreliable computations.
- Strategy synthesis for multi-dimensional quantitative objectives
- Reasoning about Data Repetitions with Counter Systems
- Solving Parity Games on Integer Vectors
- Temporal Logics on Words with Multiple Data Values.
- Concurrent Games on VASS with Inhibition
- LTL with the freeze quantifier and register automata
- Two-variable logic on data words
- Logics of Repeating Values on Data Trees and Branching Counter Systems
- Temporal Logics of Repeating Values
- Playing with Repetitions in Data Words Using Energy Games
- Reachability Games on Extended Vector Addition Systems with States
- Finite state machines for strings over infinite alphabets
- Monotonic and Downward Closed Games
This page was built for publication: Playing with Repetitions in Data Words Using Energy Games