656 articles  [version française]
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 1, Richard Castanet 2, Patrick Felix 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
Computer Science/Symbolic Computation
Attached file list to this document: 
PDF
SUI04.pdf(337.2 KB)