| HAL: hal-00408368, version 1 |
| Detailed view | Export this paper |
|
|
| Studia Informatica Universalis 3, 2 (2004) 141-168 |
|
|
|
|
| From the feasibility analysis to real-time test generation |
|
|
| Ismail Berrada 1Richard Castanet 2 |
|
|
| (2004-03-05) |
|
|
| Testing real-time systems is an important and not obvious step in the validation process of critical systems. This paper proposes an efficient o((n*k)^2) algorithm for solving the feasibility problem corresponding to a path of length n in a timed automaton, with k clocks. The given solution, combined with synchronous product, allows in particular, generating both the fastest and the slowest timed test cases for a given test purpose. |
|
|
|
|
|
|
|
|
|
|
| 1: | Laboratoire Informatique, Image et Interaction (L3I) |
| Université de La Rochelle : EA2118 | |
| 2: | Laboratoire Bordelais de Recherche en Informatique (LaBRI) |
| CNRS : UMR5800 – Université Sciences et Technologies - Bordeaux I – École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB) – Université Victor Segalen - Bordeaux II | |
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Symbolic Computation |
|
|
| Attached file list to this document: | |||||
|
|
|
| hal-00408368, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00408368 | |
| oai:hal.archives-ouvertes.fr:hal-00408368 | |
| From: Patrick Felix | |
| Submitted on: Thursday, 30 July 2009 16:11:46 | |
| Updated on: Thursday, 30 July 2009 16:14:53 | |