On the (High) Undecidability of Distributed Synthesis Problems

DOI10.1007/978-3-540-69507-3_26zbMath1132.68041OpenAlexW1497341048MaRDI QIDQ5448782

David Janin

Publication date: 7 March 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69507-3_26

Mathematics Subject Classification ID

Applications of game theory (91A80) 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 (6)

Hierarchical information and the synthesis of distributed strategies ⋮ Consensus Game Acceptors ⋮ Distributed synthesis is simply undecidable ⋮ Consensus Game Acceptors and Iterated Transductions ⋮ Infinite games with finite knowledge gaps ⋮ From Asynchronous to Synchronous Specifications for Distributed Program Synthesis

This page was built for publication: On the (High) Undecidability of Distributed Synthesis Problems