Games for Counting Abstractions1

https://doi.org/10.1016/j.entcs.2005.04.005Get rights and content
Under a Creative Commons license
open access

Abstract

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.

Keywords

Petri nets
Counting Abstraction
Games

Cited by (0)

1

Supported by the FRFC project “Centre Fédéré en Vérification” funded by the Belgian National Science Fundation (FNRS) under grant nr 2.4530.02.

2

Supported by a “First Europe” grant EPH3310300R0012 of the Walloon Region.

Copyright © 2005 Elsevier B.V.