Distributed Asynchronous Games With Causal Memory are Undecidable
From MaRDI portal
Recommendations
Cites work
- 1-safe Petri nets and special cube complexes. Equivalence and applications
- A variant of a recursively unsolvable problem
- Asynchronous Games over Tree Architectures
- Automated synthesis of distributed controllers
- Distributed synthesis for acyclic architectures
- Distributed synthesis is simply undecidable
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- scientific article; zbMATH DE number 7278100 (Why is no real title available?)
- scientific article; zbMATH DE number 5587278 (Why is no real title available?)
- scientific article; zbMATH DE number 7830376 (Why is no real title available?)
- Notes on finite asynchronous automata
- On the control of asynchronous automata
- Petri games: synthesis of distributed systems with causal memory
- Rabin's theorem in the concurrency setting: a conjecture
- Translating asynchronous games for distributed synthesis
Cited in
(5)- Asynchronous transition system games for two processes and their analysis
- Distributed controller synthesis for deadlock avoidance
- (Un)decidability bounds of the synthesis problem for Petri games
- From trees to tree-like: distribution and synthesis for asynchronous automata
- Distributed games with a central decision maker
This page was built for publication: Distributed Asynchronous Games With Causal Memory are Undecidable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5043589)
