Finding the bounds of response time of networked automation systems by iterative proofsReportar como inadecuado




Finding the bounds of response time of networked automation systems by iterative proofs - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

1 LURPA - Laboratoire Universitaire de Recherche en Production Automatisée

Abstract : 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.


Keywords : Time performances evaluation Formal verification Formal methods scalability Uppaal





Autor: Silvain Ruel - Olivier De Smet - Jean-Marc Faure -

Fuente: https://hal.archives-ouvertes.fr/



DESCARGAR PDF




Documentos relacionados