Petri Games are Monotonic but Di#cult to Decide
|
Abstract:
Abstract. In this paper, we study two-player games played on infinite but monotonic game structures. We concentrate on coverability games, a natural subclass of reachability games in the context of monotonic game structures. On the negative side, we show that surprisingly, and contrary to the one-player case, coverability is undecidable on two-player monotonic game structures. On the positive side, we identify an interesting subclass of two-player monotonic game structures, for which coverability is decidable and for which we can e#ectively construct winning strategies. Furthermore, we show how to define two-player game structures that belong to that subclass with Petri nets. The results of this paper are compared to recent results obtained independently by Abdulla, Bouajjani and d'Orso on similar game structures where they identify another subclass of monotonic game structures with decidable results. 1
Citations
| 1451 | A theory of timed automata – Alur, Dill - 1994 |
| 284 | Computation: Finite and Infinite Machines – Minsky - 1967 |
| 174 | Ordering by divisibility in abstract algebras – Higman - 1952 |
| 135 | On the synthesis of discrete controllers for timed systems – Maler, Pnueli, et al. - 1995 |
| 121 | Well-structured transition systems everywhere – Finkel, Schnoebelen - 2001 |
| 96 | Pushdown processes: Games and model checking – Walukiewicz - 1996 |
| 26 | Symbolic algorithms for infinite-state games – Alfaro, Henzinger, et al. - 2001 |
| 6 | Deciding monotonic games – Abdulla, Bouajjani, et al. - 2003 |
| 5 | Yih-Kuen Tsay. General decidability theorems for infinite-state systems – Abdulla, Cerans, et al. - 1996 |
| 2 | Jeux dans un réseau de petri (mémoire de DEA d’Algorithmique). Technical report, Ecole Normale Supérieure de Cachan – Samuelides - 2003 |
