From the feasibility analysis to real-time test generation

Overview & Synopsis

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.