The synthesis problem for repeatedly communicating Petri games

DOI10.1007/978-3-031-06653-5_13zbMath1499.68225OpenAlexW4285250995MaRDI QIDQ2165240

Paul Hannibal, Ernst-Ruediger Olderog

Publication date: 19 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-06653-5_13

zbMATH Keywords

synthesisconcurrent systemsdistributed systemsPetri netsunfoldingPetri games

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of game theory (91A80) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• 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
• Model checking using net unfoldings
• \textsc{AdamMC}: a model checker for Petri nets with transits against Flow-LTL
• Bounded Synthesis for Petri Games
• Alternating-time temporal logic
• Notes on finite asynchronous automata
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Asynchronous Games over Tree Architectures
• Automated Technology for Verification and Analysis
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science

This page was built for publication: The synthesis problem for repeatedly communicating Petri games