Distributed synthesis for well-connected architectures

DOI10.1007/S10703-008-0064-7MaRDI QIDQ842581zbMATH OpenOpenAlexFDO

Authors Paul Gastin, Nathalie Sznajder, Marc Zeitoun

Publication date 25 September 2009

Published in Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10703-008-0064-7

zbMATH Keywords

distributed systemssynthesis problemsynchronous architectures

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Distributed systems (68M14)

Recommendations

• Distributed Synthesis for Well-Connected Architectures
• Distributed synthesis for acyclic architectures
• Decidability of well-connectedness for distributed synthesis
• scientific article; zbMATH DE number 7278100
• Distributed synthesis in continuous time
• Network Synthesis for Distributed Embedded Systems
• Practical distributed control synthesis
• scientific article; zbMATH DE number 3257810
• SEMI-AUTOMATIC DISTRIBUTED SYNTHESIS
• Automated Technology for Verification and Analysis

Cites work

• scientific article; zbMATH DE number 4124989 (Why is no real title available?)
• scientific article; zbMATH DE number 1927560 (Why is no real title available?)
• scientific article; zbMATH DE number 1754607 (Why is no real title available?)
• scientific article; zbMATH DE number 1759436 (Why is no real title available?)
• CONCUR 2005 – Concurrency Theory
• Church's Problem Revisited
• Church’s Problem and a Tour through Automata Theory
• Complexity classification of network information flow problems
• Distributed Synthesis for Well-Connected Architectures
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Games for synthesis of controllers with partial observation.
• Network information flow
• On Distributed Program Specification and Synthesis in Architectures with Cycles
• On the synthesis of strategies in infinite games
• Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
• Solving Sequential Conditions by Finite-State Strategies
• Synthesis of Asynchronous Systems
• Synthesis of distributed algorithms using asynchronous automata.

Cited in

(16)

• Information tracking in games on graphs
• Synthesis in presence of dynamic links
• Distributed Synthesis for Well-Connected Architectures
• Hierarchical information and the synthesis of distributed strategies
• Distributed synthesis for regular and contextfree specifications
• Decidability of well-connectedness for distributed synthesis
• scientific article; zbMATH DE number 7278100 (Why is no real title available?)
• scientific article; zbMATH DE number 7438566 (Why is no real title available?)
• Distributed synthesis for parameterized temporal logics
• Distributed PROMPT-LTL synthesis
• scientific article; zbMATH DE number 7455739 (Why is no real title available?)
• On Distributed Program Specification and Synthesis in Architectures with Cycles
• Synthesizing strategies for homogeneous multi-agent systems with incomplete information
• Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems
• Network Synthesis for Distributed Embedded Systems
• Infinite games with finite knowledge gaps

This page was built for publication: Distributed synthesis for well-connected architectures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q842581)