High-level representation of benchmark families for Petri games

DOI10.1007/978-3-030-91384-7_7zbMath1522.68364arXiv1904.05621OpenAlexW2939501498MaRDI QIDQ6045029

Manuel Gieseking, Ernst-Ruediger Olderog

Publication date: 26 May 2023

Published in: Model Checking, Synthesis, and Learning (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (1)

Model checking, synthesis, and learning

Cites Work

• Petri games: synthesis of distributed systems with causal memory
• Petri nets, event structures and domains. I
• System modelling with high-level Petri nets
• Branching processes of Petri nets
• Unfoldings: A partial-order approach to model checking.
• Distributed synthesis for acyclic architectures
• Unbeast: Symbolic Bounded Synthesis
• Bounded Synthesis for Petri Games
• Notes on finite asynchronous automata
• Understanding Petri Nets
• Asynchronous Games over Tree Architectures
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: High-level representation of benchmark families for Petri games