Synthesis in presence of dynamic links
From MaRDI portal
Publication:2105465
DOI10.1016/j.ic.2021.104856OpenAlexW4205765403MaRDI QIDQ2105465
Patricia Bouyer, Benedikt Bollig, Matthias Függer, Nathalie Sznajder, Béatrice Bérard
Publication date: 8 December 2022
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2021.104856
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed synthesis for well-connected architectures
- The temporal semantics of concurrent programs
- Bounds on the size and transmission rate of communications protocols
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Reasoning about infinite computations
- Hierarchical information and the synthesis of distributed strategies
- Automata on infinite trees
- A characterization of oblivious message adversaries for which consensus is solvable
- The Heard-Of model: computing in distributed systems with benign faults
- Distributed computation in dynamic networks
- Church Synthesis Problem for Noisy Input
- Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms
- Synthesis of Fault-Tolerant Distributed Systems
- The Byzantine Generals Problem
- Church's Problem Revisited
- On the synthesis of strategies in infinite games
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Asynchronous Games over Tree Architectures
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- CONCUR 2005 – Concurrency Theory
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
This page was built for publication: Synthesis in presence of dynamic links
