Test Generation with Inputs, Outputs, and Quiescence

This paper studies testing based on labelled transition systems, using the assumption that implementations communicate with their environment via inputs and outputs. Such implementations are formalized by restricting the class of transition systems to those systems that can always accept input actions, as in input/output automata. Implementation relations, formalizing the notion of conformance of these implementations with respect to labelled transition system specifications, are defined analogous to the theory of testing equivalence and preorder. A test generation algorithm is given, which is proved to produce a sound and exhaustive test suite from a specification, i.e., a test suite that fully characterizes the set of correct implementations.

[1]  Rob J. van Glabbeek,et al.  The Linear Time - Branching Time Spectrum II , 1993, CONCUR.

[2]  Rocco De Nicola,et al.  A Process Algebraic View of Input/Output Automata , 1995, Theor. Comput. Sci..

[3]  Clazien D. Wezeman The CO-OP Method for Compositional Derivation of Conformance Testers , 1989, PSTV.

[4]  Jan Tretmans,et al.  A Formal Approach to Conformance Testing , 1993, Protocol Test Systems.

[5]  Guy Leduc,et al.  A Framework Based on Implementation Relations for Implementing LOTOS Specifications , 1992, Comput. Networks ISDN Syst..

[6]  Marc Phalippou Relations d'implantation et hypothèses de test sur des automates à entrées et sorties , 1994 .

[7]  Frits W. Vaandrager,et al.  On the relationship between process algebra and input/output automata , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[8]  R. J. vanGlabbeek The linear time - branching time spectrum , 1990 .

[9]  Jan Tretmans,et al.  A Queue Model Relating Synchronous and Asynchronous Communication , 1992, PSTV.

[10]  Roberto Segala Quiescence, Fairness, Testing, and the Notion of Implementation (Extended Abstract) , 1993, CONCUR.

[11]  Rob J. van Glabbeek,et al.  The Linear Time - Branching Time Spectrum I , 2001, Handbook of Process Algebra.

[12]  Roberto Segala,et al.  Quiescence, Fairness, Testing, and the Notion of Implementation , 1997, Inf. Comput..

[13]  Gilles Bernot,et al.  Testing Against Formal Specifications: A Theoretical View , 1991, TAPSOFT, Vol.2.

[14]  Nancy A. Lynch,et al.  An introduction to input/output automata , 1989 .

[15]  G. J. Tretmans Testing labelled Transition Systems with Inputs and Outputs , 1995 .