Distributed Asynchronous Games With Causal Memory are Undecidable
From MaRDI portal
Publication:5043589
DOI10.46298/lmcs-18(3:30)2022OpenAlexW4286892728MaRDI QIDQ5043589
Publication date: 6 October 2022
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.14768
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Petri games: synthesis of distributed systems with causal memory
- Rabin's theorem in the concurrency setting: a conjecture
- Distributed synthesis is simply undecidable
- Distributed synthesis for acyclic architectures
- Automated Synthesis of Distributed Controllers
- Notes on finite asynchronous automata
- 1-Safe Petri Nets and Special Cube Complexes
- Asynchronous Games over Tree Architectures
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- A variant of a recursively unsolvable problem
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science