Fair synthesis for asynchronous distributed systems

DOI10.1145/2480759.2480761MaRDI QIDQ2946693zbMATH OpenOpenAlexFDO

Authors Paul Gastin, Nathalie Sznajder

Publication date 17 September 2015

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2480759.2480761

zbMATH Keywords

Church's problemdistributed systemssemicommutationssynthesis

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems
• scientific article; zbMATH DE number 1927560
• Synthesis of Asynchronous Systems
• Synthesis of distributed algorithms using asynchronous automata.
• Distributed synthesis for acyclic architectures

Cited in

(19)

• Appraising fairness in languages for distributed programming
• Stepwise development of fair distributed systems
• Fair distributed computation of reactive functions
• Distributed synthesis for parameterized temporal logics
• On fairness notions in distributed systems. I: A characterization of implementability
• Synthesis in presence of dynamic links
• m-asynchronous cellular automata: from fairness to quasi-fairness
• Distributed synthesis in continuous time
• On Distributed Monitoring and Synthesis
• Automated synthesis of distributed controllers
• Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems
• scientific article; zbMATH DE number 139611 (Why is no real title available?)
• scientific article; zbMATH DE number 1927560 (Why is no real title available?)
• Deciding determinism with fairness for simple transducer networks
• Distributed PROMPT-LTL synthesis
• From Asynchronous to Synchronous Specifications for Distributed Program Synthesis
• Synthesis of distributed algorithms using asynchronous automata.
• Promptness and bounded fairness in concurrent and parameterized systems
• A distributed synchronization scheme for fair multi-process handshakes

This page was built for publication: Fair synthesis for asynchronous distributed systems

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