Bounded Synthesis for Petri Games
Petri games, introduced in recent joint work with Ernst-Rüdiger Olderog, are an extension of Petri nets for the causality-based synthesis of distributed systems. In a Petri game, each token is a player in a multiplayer game, played between the “environment” and “system” teams. In this paper, we prop...
Saved in:
| Published in | Correct System Design pp. 223 - 237 |
|---|---|
| Main Author | |
| Format | Book Chapter |
| Language | English |
| Published |
Cham
Springer International Publishing
|
| Series | Lecture Notes in Computer Science |
| Online Access | Get full text |
Cover
Loading…
| Summary: | Petri games, introduced in recent joint work with Ernst-Rüdiger Olderog, are an extension of Petri nets for the causality-based synthesis of distributed systems. In a Petri game, each token is a player in a multiplayer game, played between the “environment” and “system” teams. In this paper, we propose a new technique for finding winning strategies for the system players based on the bounded synthesis approach. In bounded synthesis, we limit the size of the strategy. By incrementally increasing the bound, we can focus the search towards small solutions while still eventually finding every finite winning strategy. |
|---|---|
| Bibliography: | This research was partially supported by the German Research Council (DFG) in the Transregional Collaborative Research Center SFB/TR 14 AVACS. |
| ISBN: | 9783319235059 3319235052 |
| ISSN: | 0302-9743 1611-3349 |
| DOI: | 10.1007/978-3-319-23506-6_15 |