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

Abstract : 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.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [4 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00822416
Contributor : Yann Ben Maissa <>
Submitted on : Tuesday, May 14, 2013 - 4:08:20 PM
Last modification on : Friday, April 19, 2019 - 2:26:07 PM
Document(s) archivé(s) le : Tuesday, April 4, 2017 - 7:00:17 AM

File

2012-dagstuhl.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00822416, version 1

Citation

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⟩

Share

Metrics

Record views

273

Files downloads

152