 |
 |
|
|
| HAL : hal-00359053, version 1 |
| Fiche détaillée |  Récupérer au format |
 |
| 9th International Workshop On Discrete Event Systems, WODES'08, Goteborg : Suède (2008) |
|
|
|
|
| Building effective formal models to prove time properties of networked automation systems |
|
|
| Silvain Ruel 1Olivier De Smet 1 |
|
|
| (28/05/2008) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Laboratoire Universitaire de Recherche en Production Automatisée (LURPA) |
|
|
|
École normale supérieure de Cachan - ENS Cachan – Université Paris XI - Paris Sud |
|
|
|
|
|
|
|
|
|
| Domaine | : | Sciences de l'ingénieur/Automatique / Robotique |
|
|
| Liste des fichiers attachés à ce document : | ||||||||||
|
||||||||||
|
|
|
| hal-00359053, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00359053 | |
| oai:hal.archives-ouvertes.fr:hal-00359053 | |
| Contributeur : Jean-Marc Faure | |
| Soumis le : Jeudi 5 Février 2009, 14:19:16 | |
| Dernière modification le : Lundi 9 Février 2009, 12:04:30 | |
