Solving high-level Petri games
From MaRDI portal
Publication:2182671
DOI10.1007/s00236-020-00368-5zbMath1443.68112OpenAlexW3021383971MaRDI QIDQ2182671
Manuel Gieseking, Ernst-Ruediger Olderog, Nick Würdemann
Publication date: 26 May 2020
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-020-00368-5
Applications of game theory (91A80) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Petri games: synthesis of distributed systems with causal memory
- Reachability trees for high-level Petri nets
- Petri net synthesis
- Petri nets, event structures and domains. I
- System modelling with high-level Petri nets
- Branching processes of Petri nets
- Model checking using net unfoldings
- A symbolic reachability graph for coloured Petri nets
- How to calculate symmetries of Petri nets
- \textsc{AdamMC}: a model checker for Petri nets with transits against Flow-LTL
- Unfoldings: A partial-order approach to model checking.
- Distributed synthesis for acyclic architectures
- Bounded Synthesis for Petri Games
- Automatic Symmetry Detection in Well-Formed Nets
- PN Standardisation: A Survey
- Supervisory Control of a Class of Discrete Event Processes
- Notes on finite asynchronous automata
- Understanding Petri Nets
- Symbolic reachability graph and partial symmetries
- Parameterized reachability trees for algebraic Petri nets
- Asynchronous Games over Tree Architectures
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Automated Technology for Verification and Analysis
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
This page was built for publication: Solving high-level Petri games
