Predicate diagrams for the verification of reactive systems - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2000

Predicate diagrams for the verification of reactive systems

Stephan Merz

Résumé

We define a class of diagrams that represent abstractions of---possibly infinite-state---reactive systems described by specifications written in temporal logic. Our diagrams are intended as the basis for the verification of both safety and liveness properties of such systems. Non-temporal proof obligations establish the correspondence between the original specification and the diagram, whereas model checking can be used to verify properties over finite-state abstractions. We describe the use of abstract interpretation techniques to generate proof diagrams from a given specification and user-defined predicates that represent sets of states.
Fichier non déposé

Dates et versions

inria-00099125 , version 1 (26-09-2006)

Identifiants

  • HAL Id : inria-00099125 , version 1

Citer

Dominique Cansell, Dominique Méry, Stephan Merz. Predicate diagrams for the verification of reactive systems. Second International Conference on Integrated Formal Methods - IFM'2000, 2000, Dagstuhl Castle, Germany, pp.380-397. ⟨inria-00099125⟩
65 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More