Distributed synthesis for acyclic architectures
From MaRDI portal
Publication:2978553
DOI10.4230/LIPIcs.FSTTCS.2014.639zbMath1360.68594arXiv1402.3314OpenAlexW2964248107MaRDI QIDQ2978553
Anca Muscholl, Igor Walukiewicz
Publication date: 25 April 2017
Full work available at URL: https://arxiv.org/abs/1402.3314
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed systems (68M14)
Related Items (14)
Distributed Asynchronous Games With Causal Memory are Undecidable ⋮ Hierarchical information and the synthesis of distributed strategies ⋮ Automated Synthesis of Distributed Controllers ⋮ On Distributed Monitoring and Synthesis ⋮ Solving high-level Petri games ⋮ High-level representation of benchmark families for Petri games ⋮ Unnamed Item ⋮ Efficient Trace Encodings of Bounded Synthesis for Asynchronous Distributed Systems ⋮ Petri games: synthesis of distributed systems with causal memory ⋮ Infinite games with finite knowledge gaps ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Automated Synthesis: a Distributed Viewpoint ⋮ Canonical representations for direct generation of strategies in high-level Petri games
This page was built for publication: Distributed synthesis for acyclic architectures