 |
|
|
|
| HAL: hal-00534896, version 1 |
| Detailed view |  Export this paper |
|
|
|
|
| Quantitative Robustness Analysis of Flat Timed Automata |
|
|
| Remi Jaubert 1Pierre-Alain Reynier 1 |
|
|
| (2010-10-08) |
|
|
|
| Whereas formal verification of timed systems has become a very active field of research, the idealized mathematical semantics of timed automata cannot be faithfully implemented. Recently, several works have studied a parametric semantics of timed automata related to implementability: if the specification is met for some positive value of the parameter, then there exists a correct implementation. In addition, the value of the parameter gives lower bounds on sufficient resources for the implementation. In this work, we present a symbolic algorithm for the computation of the parametric reachability set under this semantics for flat timed automata. As a consequence, we can compute the largest value of the parameter for a timed automaton to be safe. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Laboratoire d'informatique Fondamentale de Marseille (LIF) |
|
|
|
CNRS : UMR6166 – Université de la Méditerranée - Aix-Marseille II – Université de Provence - Aix-Marseille I |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Modeling and Simulation |
|
|
| Timed Automata – symbolic algorithm – reachability – robustness |
|
|
|
| Attached file list to this document: | |||||
|
|||||
|
|
|
| hal-00534896, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00534896 | |
| oai:hal.archives-ouvertes.fr:hal-00534896 | |
| From: Rem Jaubert | |
| Submitted on: Wednesday, 10 November 2010 18:08:27 | |
| Updated on: Friday, 12 November 2010 16:21:24 | |
