Hierarchy is Good For Discrete Time: a Compositional Approach to Discrete Time Verification - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

Hierarchy is Good For Discrete Time: a Compositional Approach to Discrete Time Verification

Résumé

Model checking is now widely used as an automatic and exhaustive way to verify complex systems. However, this approach suffers from an intrinsic combinatorial explosion, due to both a high number of synchronized components and a high level of expressivity in these components. With respect to the expressivity issue, we consider the particular problem of introducing explicit time constraints in the components of a system. In this modeling step, the choice of a time domain is important, impacting on the size of the resulting model, the class of properties which can be verified and the performances of the verification. In this presentation, we show that hierarchical encoding of elementary com- ponents encapsulating labeled transition systems (LTS), synchronized by means of public transitions, is an efficient way to encode discrete time.
Fichier principal
Vignette du fichier
2012-dagstuhl.pdf (133.45 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00822416 , version 1 (14-05-2013)

Identifiants

  • HAL Id : hal-00822416 , version 1

Citer

Fabrice Kordon, Béatrice Berard, Yann Thierry-Mieg, Yann Ben Maissa. Hierarchy is Good For Discrete Time: a Compositional Approach to Discrete Time Verification. Dagstuhl seminar "Architecture-Driven Semantic Analysis of Embedded Systems", Jul 2012, Dagstuhl, Germany. pp.38-39. ⟨hal-00822416⟩
197 Consultations
72 Téléchargements

Partager

Gmail Facebook X LinkedIn More