Jump to : Download | Abstract | Contact | BibTex reference | EndNote reference |

LMCS12

N. Bertrand, T. Jéron, A. Stainer, M. Krichen. Off-line Test Selection with Test Purposes for Non-Deterministic Timed Automata. Logical Methods in Computer Science, 8(4), March 2012.

Download [help]

Download paper: Doi page

Download paper: Adobe portable document (pdf) pdf

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
This page is automatically generated by bib2html v216, © INRIA 2002-2007, Projet Lagadic

Abstract

This article proposes novel off-line test generation techniques from non-deterministic timed automata with inputs and outputs (TAIOs) in the formal framework of the tioco conformance theory. In this context, a fi?rst problem is the determinization of TAIOs, which is necessary to foresee next enabled actions after an observable trace, but is in general impossible because not all timed automata are determinizable. This problem is solved thanks to an approximate determinization using a game approach. The algorithm performs an io-abstraction which preserves the tioco conformance relation and thus guarantees the soundness of generated test cases. A second problem is the selection of test cases from a TAIO specification. The selection here relies on a precise description of timed behaviors to be tested which is carried out by expressive test purposes modeled by a generalization of TAIOs. Finally, an algorithm is described which generates test cases in the form of TAIOs equipped with verdicts, using a symbolic co-reachability analysis guided by the test purpose. Properties of test cases are then analyzed with respect to the precision of the approximate determinization: when determinization is exact, which is the case on known determinizable classes, in addition to soundness, properties characterizing the adequacy of test cases verdicts are also guaranteed

Contact

Nathalie Bertrand http://www.irisa.fr/prive/nbertran/
Thierry Jéron http://www.irisa.fr/prive/jeron

BibTex Reference

@article{LMCS12,
   Author = {Bertrand, N. and Jéron, T. and Stainer, A. and Krichen, M.},
   Title = {Off-line Test Selection with Test Purposes for Non-Deterministic Timed Automata},
   Journal = {Logical Methods in Computer Science},
   Volume = {8},
   Number = {4},
   Month = {March},
   Year = {2012}
}

EndNote Reference [help]

Get EndNote Reference (.ref)