Distributed synthesis is simply undecidable
DOI10.1016/J.IPL.2013.11.012zbMATH Open1358.68196OpenAlexW2087527826MaRDI QIDQ2445907FDOQ2445907
Authors: Sven Schewe 
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
Recommendations
Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solving Sequential Conditions by Finite-State Strategies
- Nondeterministic controllers of nondeterministic processes
- Title not available (Why is that?)
- On the (High) Undecidability of Distributed Synthesis Problems
- Definability in the monadic second-order theory of successor
Cited In (9)
- Consensus game acceptors
- Decidability of well-connectedness for distributed synthesis
- Distributed synthesis for parameterized temporal logics
- Distributed PROMPT-LTL synthesis
- Distributed Asynchronous Games With Causal Memory are Undecidable
- Stochastic games with synchronizing objectives
- Unlimited Decidability of Distributed Synthesis with Limited Missing Knowledge
- Undecidability in decentralized supervision
- On the (High) Undecidability of Distributed Synthesis Problems
This page was built for publication: Distributed synthesis is simply undecidable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2445907)
