Predicate Diagrams for the Verification of Real-Time Systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2005

Predicate Diagrams for the Verification of Real-Time Systems


We propose a 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 modeling 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 paper is to extend the format of predicate diagrams to timed systems. We also 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. 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
final.pdf (227.23 Ko) Télécharger le fichier

Dates and versions

inria-00000631 , version 1 (10-11-2005)


  • HAL Id : inria-00000631 , version 1


Eunyoung Kang, Stephan Merz. Predicate Diagrams for the Verification of Real-Time Systems. The Fifth International Workshop on Automated Verification of Critical Systems 2005 - AVoCS'05, Ranko Lazic, Rajagopal Nagarajan, Nikolaos Papanikolaou, Sep 2005, Coventry/UK. ⟨inria-00000631⟩
101 View
144 Download


Gmail Facebook Twitter LinkedIn More