Automatic Verification of Counter Systems with Ranking Functions

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01334858
Contributor : Lip6 Publications <>
Submitted on : Tuesday, June 21, 2016 - 2:26:11 PM
Last modification on : Thursday, March 21, 2019 - 2:39:38 PM

Identifiers

  • HAL Id : hal-01334858, version 1

Citation

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

Share

Metrics

Record views

37