Synthesising full-information protocols
From MaRDI portal
Cites work
- A perfect-information construction for coordination in games
- A recursive approach to solving parity games in quasipolynomial time
- Algorithms for Omega-Regular Games with Imperfect Information
- Asynchronous Games over Tree Architectures
- Continuous consensus with ambiguous failures
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Deciding Parity Games in Quasi-polynomial Time
- Distributed synthesis is simply undecidable
- Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata
- Games for synthesis of controllers with partial observation.
- Hierarchical information and the synthesis of distributed strategies
- scientific article; zbMATH DE number 3930354 (Why is no real title available?)
- scientific article; zbMATH DE number 3492660 (Why is no real title available?)
- scientific article; zbMATH DE number 3189696 (Why is no real title available?)
- Knowledge and common knowledge in a Byzantine environment: Crash failures
- Lower bounds for multiplayer noncooperative games of incomplete information
- Monadic decomposability of regular relations
- Observation and distinction: representing information in infinite games
- On the synthesis of strategies in infinite games
- Reaching Agreement in the Presence of Faults
- The complexity of two-player games of incomplete information
- Universal algorithms for parity games and nested fixpoints
This page was built for publication: Synthesising full-information protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7391885)
