Games for Counting Abstractions

Jean-François Raskin (1) , Mathias Samuelides (2) , Laurent van Begin (1)

1 ULB - Département d'Informatique [Bruxelles]
2 ENS Cachan - École normale supérieure - Cachan

It has been recently shown that monotonicity is not sufficient to obtain decidability results for two-player games. However, positive results can be obtained on restricted subclasses of monotonic two-player games. In this paper, we identify and study a subclass of monotonic two-player games that is useful for analysis of parametric (open) systems that can be modeled by using counting abstractions. Although the reachability game problem is undecidable in general for that subclass, we identify two interesting and decidable problems and show how to apply those results in parametric system analysis.

Mots clés: Petri nets; Counting Abstraction; Games

Domaines: Informatique et théorie des jeux [cs.GT]

Jean-François Raskin, Mathias Samuelides, Laurent van Begin. Games for Counting Abstractions. Electronic Notes in Theoretical Computer Science, 2005, 128 (6), pp.69-85. ⟨10.1016/j.entcs.2005.04.005⟩. ⟨hal-00158701⟩