Building effective formal models to prove time properties of networked automation systems

Abstract : This paper proposes a method to build formal models of networked automation systems, in the form of sets of communicating timed automata, which are reduced enough to avoid (or limit) combinatory explosion, but accurate enough to provide meaningful proof results, when they are checked. This method starts from a detailed initial model, which includes all behaviours of all components of the system, and comprises two steps. First, given a property to prove, the structure of the model is simplified so as to keep only the components models which impact directly this proof. Then the formal models of the remaining components are modified to take the previous simplification into account; the resulting models are worst-case models which guarantee trustworthy results. Experiments show the effectiveness of this modeling.
Type de document :
Communication dans un congrès
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00359053
Contributeur : Jean-Marc Faure <>
Soumis le : jeudi 5 février 2009 - 14:19:16
Dernière modification le : jeudi 9 février 2017 - 16:00:22
Document(s) archivé(s) le : mardi 8 juin 2010 - 19:11:28

Identifiants

  • HAL Id : hal-00359053, version 1

Collections

Citation

Silvain Ruel, Olivier de Smet, Jean-Marc Faure. Building effective formal models to prove time properties of networked automation systems. 9th International Workshop On Discrete Event Systems, WODES'08, May 2008, Goteborg, Sweden. pp. 334-339. ⟨hal-00359053⟩

Partager

Métriques

Consultations de la notice

112

Téléchargements de fichiers

157