Distributed synthesis is simply undecidable

DOI10.1016/j.ipl.2013.11.012zbMath1358.68196OpenAlexW2087527826MaRDI QIDQ2445907

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

zbMATH Keywords

undecidabilityformal methodstemporal logicdistributed synthesis

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Decidability of theories and sets of sentences (03B25)

Related Items (4)

Distributed Asynchronous Games With Causal Memory are Undecidable ⋮ Consensus Game Acceptors ⋮ Unnamed Item ⋮ Distributed synthesis for parameterized temporal logics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Distributed synthesis is simply undecidable