Distributed synthesis is simply undecidable
From MaRDI portal
Publication:2445907
DOI10.1016/j.ipl.2013.11.012zbMath1358.68196MaRDI QIDQ2445907
Publication date: 15 April 2014
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2013.11.012
68Q60: Specification and verification (program logics, model checking, etc.)
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
03B25: Decidability of theories and sets of sentences
Related Items
Unnamed Item, Distributed Asynchronous Games With Causal Memory are Undecidable, Distributed synthesis for parameterized temporal logics, Consensus Game Acceptors
Cites Work
- On the (High) Undecidability of Distributed Synthesis Problems
- Solving Sequential Conditions by Finite-State Strategies
- Definability in the monadic second-order theory of successor
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item