Translating asynchronous games for distributed synthesis

DOI10.4230/LIPICS.CONCUR.2019.26MaRDI QIDQ5875388zbMATH OpenFDO

Authors Raven Beutner, Bernd Finkbeiner, Jesko Hecking-Harbusch

Publication date 3 February 2023

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

zbMATH Keywords

causal memorycontrol gamesdistributed systemsPetri gamessynthesis

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• LATIN 2004: Theoretical Informatics
• Petri games: synthesis of distributed systems with causal memory
• Petri games: synthesis of distributed systems with causal memory
• The synthesis problem for repeatedly communicating Petri games
• From Asynchronous to Synchronous Specifications for Distributed Program Synthesis

Cites work

• \textsc{AdamMC}: a model checker for Petri nets with transits against Flow-LTL
• Asynchronous Games over Tree Architectures
• Automated synthesis of distributed controllers
• Bounded synthesis for Petri games
• Branching processes of Petri nets
• Concurrent bisimulations in Petri nets
• Distributed synthesis for acyclic architectures
• Efficient trace encodings of bounded synthesis for asynchronous distributed systems
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• scientific article; zbMATH DE number 3885321 (Why is no real title available?)
• scientific article; zbMATH DE number 1927560 (Why is no real title available?)
• scientific article; zbMATH DE number 7278100 (Why is no real title available?)
• scientific article; zbMATH DE number 5587278 (Why is no real title available?)
• Notes on finite asynchronous automata
• On the control of asynchronous automata
• Petri games: synthesis of distributed systems with causal memory
• Petri nets, event structures and domains. I
• Process versus unfolding semantics for Place/Transition Petri nets
• Solving Sequential Conditions by Finite-State Strategies
• Unfoldings: A partial-order approach to model checking.

Cited in

(9)

• The synthesis problem for repeatedly communicating Petri games
• Solving high-level Petri games
• Efficient trace encodings of bounded synthesis for asynchronous distributed systems
• Distributed Asynchronous Games With Causal Memory are Undecidable
• Asynchronous Games over Tree Architectures
• Asynchronous transition system games for two processes and their analysis
• Distributed controller synthesis for deadlock avoidance
• (Un)decidability bounds of the synthesis problem for Petri games
• From trees to tree-like: distribution and synthesis for asynchronous automata

This page was built for publication: Translating asynchronous games for distributed synthesis

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