Vérification de systèmes hiérarchiques par raffinement

Abstract

This article treats the specification and verification by model-checking the reactive hierarchical systems. The model used is the hierarchical automata which exploits the decomposition of a state in to a set of acyclic automata. In order to deal with the problem of the state explosion induced by the model-checking, we propose to use the technique of refinement. The contribution of this paper is to define the conditions of refinement between hierarchical automata. This refinement involves the refinement of their models which are Kripke structures. This property is necessary to preserve the properties of linear temporal logic on the Kripke structures. The properties are verified only on the abstract model with small size.