Canonical representations for direct generation of strategies in high-level Petri games
From MaRDI portal
Publication:2117156
DOI10.1007/978-3-030-76983-3_6zbMath1489.68159arXiv2112.04476OpenAlexW3167615348MaRDI QIDQ2117156
Manuel Gieseking, Nick Würdemann
Publication date: 21 March 2022
Full work available at URL: https://arxiv.org/abs/2112.04476
Applications of game theory (91A80) Specification and verification (program logics, model checking, etc.) (68Q60) 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
- Unnamed Item
- Unnamed Item
- Petri games: synthesis of distributed systems with causal memory
- A symbolic reachability graph for coloured Petri nets
- Automata, logics, and infinite games. A guide to current research
- Solving high-level Petri games
- Unfoldings: A partial-order approach to model checking.
- Distributed synthesis for acyclic architectures
- PN Standardisation: A Survey
- Symbolic reachability graph and partial symmetries
- Asynchronous Games over Tree Architectures
- Automated Technology for Verification and Analysis
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science