Using CTL formulae as component abstraction in a design and verification flow - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2007

Using CTL formulae as component abstraction in a design and verification flow

Résumé

In the context of component-based design, the verification of global properties (involving several components) is difficult to achieve, due to combinatorial explosion problem, while the verification of each component is easier to perform. Following the idea of [24], we propose to build an abstraction of a component already verified, starting from a subset of its specification described as CTL formulae. This abstraction replaces the concrete component and alleviates the state-space explosion problem for checking global properties expressed in ACTL.
Fichier non déposé

Dates et versions

hal-01305787 , version 1 (21-04-2016)

Identifiants

Citer

Cécile Braunstein, Emmanuelle Encrenaz. Using CTL formulae as component abstraction in a design and verification flow. ACSD IEEE International Conference on Application of Concurrency to System Design, Jul 2007, Bratislava, Slovakia. pp.80-89, ⟨10.1109/ACSD.2007.76⟩. ⟨hal-01305787⟩
26 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More