scientific article; zbMATH DE number 7649934

DOI10.4230/LIPIcs.CONCUR.2019.26MaRDI QIDQ5875388

Jesko Hecking-Harbusch, Bernd Finkbeiner, Raven Beutner

Publication date: 3 February 2023

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

synthesisdistributed systemscontrol gamesPetri gamescausal memory

Mathematics Subject Classification ID

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

Related Items

Distributed Asynchronous Games With Causal Memory are Undecidable, The synthesis problem for repeatedly communicating Petri games, Solving high-level Petri games, Efficient Trace Encodings of Bounded Synthesis for Asynchronous Distributed Systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Petri games: synthesis of distributed systems with causal memory
• Process versus unfolding semantics for Place/Transition Petri nets
• Petri nets, event structures and domains. I
• Branching processes of Petri nets
• \textsc{AdamMC}: a model checker for Petri nets with transits against Flow-LTL
• Unfoldings: A partial-order approach to model checking.
• Concurrent bisimulations in Petri nets
• Distributed synthesis for acyclic architectures
• Efficient Trace Encodings of Bounded Synthesis for Asynchronous Distributed Systems
• Automated Synthesis of Distributed Controllers
• Bounded Synthesis for Petri Games
• Notes on finite asynchronous automata
• Asynchronous Games over Tree Architectures
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Solving Sequential Conditions by Finite-State Strategies
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science