Hierarchical information and the synthesis of distributed strategies

DOI10.1007/s00236-017-0306-5zbMath1408.91004arXiv1506.03883MaRDI QIDQ1629748

Anup Basil Mathew, Marie van den Bogaard, Dietmar Berwanger

Publication date: 12 December 2018

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.03883

zbMATH Keywords

distributed systems; infinite games; coordination; imperfect information; automated synthesis

Mathematics Subject Classification ID

91A43: Games involving graphs

91A06: (n)-person games, (n>2)

93B50: Synthesis problems

68M14: Distributed systems

Related Items

Unnamed Item, Synthesis in presence of dynamic links

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Information tracking in games on graphs
• Distributed synthesis for well-connected architectures
• The method of forced enumeration for nondeterministic automata
• The complexity of reasoning about knowledge and time. I: Lower bounds
• Space-bounded reducibility among combinatorial problems
• Automata, logics, and infinite games. A guide to current research
• Economy of description for single-valued transducers
• A Perfect-Information Construction for Coordination in Games
• Distributed synthesis for acyclic architectures
• Hierarchical Information Patterns and Distributed Strategy Synthesis
• Five Determinisation Algorithms
• Nondeterministic Space is Closed under Complementation
• On the synthesis of strategies in infinite games
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• On the (High) Undecidability of Distributed Synthesis Problems
• Automated Technology for Verification and Analysis
• Solving Sequential Conditions by Finite-State Strategies
• Lower bounds for multiplayer noncooperative games of incomplete information