Model Checking Coverability Graphs of Vector Addition Systems

Michel Blockelet (1) , Sylvain Schmitz (1)

1 LSV - Laboratoire Spécification et Vérification [Cachan]

A large number of properties of a vector addition system--for instance coverability, boundedness, or regularity--can be decided using its coverability graph, by looking for some characteristic pattern. We propose to unify the known exponential-space upper bounds on the complexity of such problems on vector addition systems, by seeing them as instances of the model-checking problem for a suitable extension of computation tree logic, which allows to check for the existence of these patterns. This provides new insights into what constitutes a "coverability-like" property.

Mots clés: Vector Addition Systems; CTL; Coverability Properties; Complexity

Domaines: Logique en informatique [cs.LO]

Michel Blockelet, Sylvain Schmitz. Model Checking Coverability Graphs of Vector Addition Systems. MCFS, 2011, Warsaw, Poland. pp.108--119, ⟨10.1007/978-3-642-22993-0_13⟩. ⟨hal-00600077⟩