Synthesising asynchronous automata from fair specifications

DOI10.1007/978-3-032-22730-0_7MaRDI QIDQ7317479zbMATH OpenFDO

Authors Béatrice Bérard, Benjamin Monmege, B. Srivathsan, Arnab Sur

Publication date 24 August 2026

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-032-22730-0_7

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• A quadratic construction for Zielonka automata with acyclic communication structure
• An expressively complete local past propositional dynamic logic over Mazurkiewicz traces and its applications
• Asynchronous mappings and asynchronous cellular automata
• Automata on distributed alphabets
• Combinatorial problems of commutation and rearrangements
• Compositional synthesis of asynchronous automata
• Constructing Exponential-Size Deterministic Zielonka Automata
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• scientific article; zbMATH DE number 6687767 (Why is no real title available?)
• scientific article; zbMATH DE number 554484 (Why is no real title available?)
• Keeping track of the latest gossip in a distributed system
• Notes on finite asynchronous automata
• Optimal Zielonka-type construction of deterministic asynchronous automata
• Synthesis of distributed algorithms using asynchronous automata.
• Unfolding Synthesis of Asynchronous Automata

This page was built for publication: Synthesising asynchronous automata from fair specifications

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