Asynchronous Games over Tree Architectures

DOI10.1007/978-3-642-39212-2_26zbMath1334.68150arXiv1204.0077OpenAlexW1639817379MaRDI QIDQ5327440

Anca Muscholl, Hugo Gimbert, Igor Walukiewicz, Blaise Genest

Publication date: 7 August 2013

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Games involving graphs (91A43) Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (18)

Distributed Asynchronous Games With Causal Memory are Undecidable ⋮ Automated Synthesis of Distributed Controllers ⋮ Bounded Synthesis for Petri Games ⋮ On Distributed Monitoring and Synthesis ⋮ The synthesis problem for repeatedly communicating Petri games ⋮ Solving high-level Petri games ⋮ High-level representation of benchmark families for Petri games ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Efficient Trace Encodings of Bounded Synthesis for Asynchronous Distributed Systems ⋮ Petri games: synthesis of distributed systems with causal memory ⋮ Synchronization of Bernoulli sequences on shared letters ⋮ Distributed Synthesis in Continuous Time ⋮ Unnamed Item ⋮ Synthesis in presence of dynamic links ⋮ Automated Synthesis: a Distributed Viewpoint ⋮ Canonical representations for direct generation of strategies in high-level Petri games

This page was built for publication: Asynchronous Games over Tree Architectures