Automatic Verification of Counter Systems with Ranking Functions - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2007

Automatic Verification of Counter Systems with Ranking Functions

Alain Finkel

Résumé

The verification of final termination for counter systems is undecidable. For non flattable counter systems, the verification of this type of property is generally based on the exhibition of a ranking function. Proving the existence of a ranking function for general counter systems is also undecidable. We provide a framework in which the verification whether a given function is a ranking function is decidable. This framework is applicable to convex counter systems which admit a Presburger or a LPDS ranking function. This extends the results of [6]. From this framework, we derive a model-checking algorithm to verify whether a final termination property is satisfied or not. This approach has been successfully applied to the verification of a parametric version of the ZCSP protocol.
Fichier non déposé

Dates et versions

hal-01334858 , version 1 (21-06-2016)

Identifiants

  • HAL Id : hal-01334858 , version 1

Citer

Emmanuelle Encrenaz, Alain Finkel. Automatic Verification of Counter Systems with Ranking Functions. INFINITY International Symposium on Infinite-Space Systems, 2007, Porto, Portugal. ⟨hal-01334858⟩
36 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More