Distributed synthesis for well-connected architectures
From MaRDI portal
Publication:842581
DOI10.1007/s10703-008-0064-7zbMath1180.68056OpenAlexW2093327611MaRDI QIDQ842581
Nathalie Sznajder, Paul Gastin, Marc Zeitoun
Publication date: 25 September 2009
Published in: Formal Methods in System Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10703-008-0064-7
Specification and verification (program logics, model checking, etc.) (68Q60) Distributed systems (68M14)
Related Items (10)
Hierarchical information and the synthesis of distributed strategies ⋮ Information tracking in games on graphs ⋮ Decidability of well-connectedness for distributed synthesis ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Infinite games with finite knowledge gaps ⋮ Distributed synthesis for parameterized temporal logics ⋮ Synthesizing Strategies for Homogenous Multi-Agent Systems with Incomplete Information ⋮ Synthesis in presence of dynamic links
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
- Games for synthesis of controllers with partial observation.
- Synthesis of Asynchronous Systems
- On Distributed Program Specification and Synthesis in Architectures with Cycles
- Church's Problem Revisited
- Network information flow
- On the synthesis of strategies in infinite games
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Distributed Synthesis for Well-Connected Architectures
- Church’s Problem and a Tour through Automata Theory
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Solving Sequential Conditions by Finite-State Strategies
- CONCUR 2005 – Concurrency Theory
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- CONCUR 2003 - Concurrency Theory
This page was built for publication: Distributed synthesis for well-connected architectures