Timed test cases generation based on state characterization technique

Real time reactive systems interact with their environment, using inputs and outputs, within specified time constraints. For such systems, a functional misbehavior or a deviation from the specified time constraints may have catastrophic consequences. Therefore, ensuring the correctness of real time systems becomes very important. We introduce the potential faults which can be encountered in a timed system implementation. We adapt an existing test cases generation technique, based on state characterization set, to generate timed test cases from a timed system specification. We model a timed system with a Timed Input Output Automaton (TIOA), which is a variant of the Alur and Dill model (R. Alur and D. Dill, 1994). In order to generate the timed test suite, the TIOA is first transformed into a Nondeterministic Timed Finite State Machine (NTFSM) with a given granularity. We illustrate our method with an example.

[1]  Frits W. Vaandrager,et al.  Minimizable Timed Automata , 1996, FTRTFT.

[2]  Nancy A. Lynch,et al.  Using mappings to prove timing properties , 1990, PODC '90.

[3]  Wang Yi,et al.  Time-abstracted Bisimulation: Implicit Specifications and Decidability , 1997, Inf. Comput..

[4]  Wang Yi,et al.  Time Abstracted Bisimiulation: Implicit Specifications and Decidability , 1993, MFPS.

[5]  Ferhat Khendek,et al.  Test Selection Based on Finite State Models , 1991, IEEE Trans. Software Eng..

[6]  Tsun S. Chow,et al.  Testing Software Design Modeled by Finite-State Machines , 1978, IEEE Transactions on Software Engineering.

[7]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[8]  B. Dasarathy,et al.  Timing Constraints of Real-Time Systems: Constructs for Expressing Them, Methods of Validating Them , 1989, IEEE Transactions on Software Engineering.

[9]  I. Lee,et al.  Automatic generation of tests for timing constraints from requirements , 1997, Proceedings Third International Workshop on Object-Oriented Real-Time Dependable Systems.

[10]  Giuseppe Scollo,et al.  Lotos specifications, their implementations and their tests , 1995 .

[11]  P. Merlin,et al.  Recoverability of Communication Protocols - Implications of a Theoretical Study , 1976, IEEE Transactions on Communications.

[12]  Karlis Cerans,et al.  Decidability of Bisimulation Equivalences for Parallel Timer Processes , 1992, CAV.

[13]  Joseph Sifakis,et al.  Compiling Real-Time Specifications into Extended Automata , 1992, IEEE Trans. Software Eng..

[14]  Sandro Morasca,et al.  Generating test cases for real-time systems from logic specifications , 1995, TOCS.

[15]  Alexandre Petrenko,et al.  Test Selection Based on Communicating Nondeterministic Finite-State Machines Using a Generalized WP-Method , 1994, IEEE Trans. Software Eng..