Predicate Diagrams for the Verification of Real-Time Systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Formal Aspects of Computing Year : 2007

Predicate Diagrams for the Verification of Real-Time Systems


This article discusses a new format of predicate diagrams for the verification of real-time systems. We consider systems that are defined as extended timed graphs, a format that combines timed automata and constructs for modelling data, possibly over infinite domains. Predicate diagrams are succinct and intuitive representations of Boolean abstractions. They also represent an interface between deductive tools used to establish the correctness of an abstraction, and model checking tools that can verify behavioral properties of finite-state models. The contribution of this article is to extend the format of predicate diagrams to timed systems. We establish a set of verification conditions that are sufficient to prove that a given predicate diagram is a correct abstraction of an extended timed graph; these verification conditions can often be discharged with SMT solvers such as CVC-lite. Additionally, we describe how this approach extends naturally to the verification of parameterized systems. The formalism is supported by a toolkit, and we demonstrate its use at the hand of Fischer's real-time mutual-exclusion protocol.
Fichier principal
Vignette du fichier
0819.pdf (216.29 Ko) Télécharger le fichier

Dates and versions

inria-00112065 , version 1 (08-11-2006)



Eunyoung Kang, Stephan Merz. Predicate Diagrams for the Verification of Real-Time Systems. Formal Aspects of Computing, 2007, 19 (3), pp.401-413. ⟨10.1007/s00165-007-0030-y⟩. ⟨inria-00112065⟩
124 View
180 Download



Gmail Facebook X LinkedIn More