scientific article; zbMATH DE number 7455739
From MaRDI portal
Publication:5020999
Benedikt Bollig, Patricia Bouyer, Béatrice Bérard, Matthias Függer, Nathalie Sznajder
Publication date: 11 January 2022
Full work available at URL: https://arxiv.org/abs/2002.07545
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Applications of game theory (91A80) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Binary recursive arithmetic
- Distributed synthesis for well-connected architectures
- The temporal semantics of concurrent programs
- Bounds on the size and transmission rate of communications protocols
- Progress measures, immediate determinacy, and a subset construction for tree automata
- Reasoning about infinite computations
- Hierarchical information and the synthesis of distributed strategies
- The Heard-Of model: computing in distributed systems with benign faults
- A Characterization of Dynamic Networks Where Consensus Is Solvable
- 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
- Automated Technology for Verification and Analysis
- CONCUR 2005 – Concurrency Theory
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
This page was built for publication:
