Finding the bounds of response time of networked automation systems by iterative proofs - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

Finding the bounds of response time of networked automation systems by iterative proofs

Résumé

Response time of modern automation systems is not constant but is featured by a distribution of values; finding the upper and lower bounds of this distribution is a crucial issue when designing critical systems. This paper shows how to obtain these bounds by proving timed properties on a formal model of the system, in the form of communicating timed automata. In this approach, bounds are obtained by iterative proofs of properties which are expressed by means of a parametric observer. Comparison of analysis results of formal models to measures on real automation systems shows the accuracy and interest of this approach.
Fichier principal
Vignette du fichier
Version_finale_Ruel_INCOM_2009.pdf (635.13 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00379372 , version 1 (28-04-2009)

Identifiants

  • HAL Id : hal-00379372 , version 1

Citer

Silvain Ruel, Olivier de Smet, Jean-Marc Faure. Finding the bounds of response time of networked automation systems by iterative proofs. 13th IFAC Symposium on Information Control Problems in Manufacturing (INCOM 2009), Jun 2009, Moscow, Russia. paper 63. ⟨hal-00379372⟩
74 Consultations
130 Téléchargements

Partager

Gmail Facebook X LinkedIn More