Conformance Testing with Labelled Transition Systems: Implementation Relations and Test Generation

This paper studies testing based on labelled transition systems, presenting two test generation algorithms with their corresponding implementation relations. The first algorithm assumes that implementations communicate with their environment via symmetric, synchronous interactions. It is based on the theory of testing equivalence and preorder, as is most of the testing theory for labelled transition systems, and it is found in the literature in some slightly different variations. The second algorithm is based on the assumption that implementations communicate with their environment via inputs and outputs. Such implementations are formalized by restricting the class of labelled transition systems to those systems that can always accept input actions. For these implementations a testing theory is developed, analogous to the theory of testing equivalence and preorder. It consists of implementation relations formalizing the notion of conformance of these implementations with respect to labelled transition system specifications, test cases and test suites, test execution, the notion of passing a test suite, and the test generation algorithm, which is proved to produce sound test suites for one of the implementation relations.

[1]  Marc Phalippou,et al.  Abstract testing and concrete testers , 1995, PSTV.

[2]  Carl A. Sunshine,et al.  Protocol Specification, Testing and Verification - Guest Editorial , 1982, Comput. Networks.

[3]  M. W. Shields.  An Introduction to Automata Theory , 1988 .

[4]  Iain Phillips,et al.  Refusal Testing , 1986, Theoretical Computer Science.

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

[6]  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.

[7]  Rance Cleaveland,et al.  Divergence and Fair Testing , 1995, ICALP.

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

[9]  Khalil Drira,et al.  Refusal Graphs for Conformance Tester Generation and Simplification: A Computational Framework , 1993, Protocol Specification, Testing and Verification.

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

[11]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

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

[13]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[14]  David H. Pitt,et al.  The Derivation of Conformance Tests from LOTOS Specifications , 1990, IEEE Trans. Software Eng..

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

[16]  Arend Rensink,et al.  Fair testing , 1995, Inf. Comput..

[17]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[18]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[19]  Rocco De Nicola,et al.  Testing Equivalences for Processes , 1984, Theor. Comput. Sci..

[20]  Jan A. Bergstra,et al.  Algebra of Communicating Processes with Abstraction , 1985, Theor. Comput. Sci..

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

[22]  Son T. Vuong,et al.  Protocol Specification, Testing and Verification XIV , 1995, IFIP Advances in Information and Communication Technology.

[23]  Jan Tretmans.  Test Case Derivation from LOTOS Specifications , 1989, FORTE.

[24]  Jan Tretmans,et al.  A Framework for Test Selection , 1991, PSTV.

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

[26]  K. K. Sandhu,et al.  Specification and description language (SDL) , 1992 .

[27]  Samson Abramsky,et al.  Observation Equivalence as a Testing Equivalence , 1987, Theor. Comput. Sci..

[28]  Alexandre Petrenko,et al.  Modeling basic LOTOS by FSMs for conformance testing , 1995, PSTV.

[29]  John L Berg,et al.  Protocol specification, testing, and verification, IV: edited by Shaula Yemini, Yechiam Yemini, and Robert Strom, 1987; North-Holland, Amsterdam, The Netherlands; 720 pages; hardback; $75.00; Illustrations, references; ISBN 0 444 87676 6. , 1988 .

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

[31]  Kim G. Larsen,et al.  Bisimulation through Probabilistic Testing , 1991, Inf. Comput..

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

[33]  Rudie Alderden,et al.  COOPER - The Compositional Construction of a Canonical Tester , 1989, Formal Techniques for (Networked and) Distributed Systems.

[34]  G. Bochmann,et al.  Fault Models in Testing , 1991, Protocol Test Systems.

[35]  R. V. Glabbeek.  The Linear Time - Branching Time Spectrum II: The Semantics of Sequential Systems with Silent Moves , 1993 .

[36]  Ivan Christoff,et al.  Testing Equivalences and Fully Abstract Models for Probabilistic Processes , 1990, CONCUR.

[37]  Tommaso Bolognesi,et al.  Tableau methods to describe strong bisimilarity on LOTOS processes involving pure interleaving and enabling , 1994, FORTE.

[38]  Kim G. Larsen,et al.  Bisimulation through probabilistic testing (preliminary report) , 1989, POPL '89.

[39]  Rom Langerak.  A Testing Theory for LOTOS using Deadlock Detection , 1989, PSTV.

[40]  Jan Tretmans,et al.  On Asynchronous Testing , 1992, Protocol Test Systems.

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

[42]  M. Ümit Uyar,et al.  Finite State Machine Based Formal Methods in Protocol Conformance Testing: From Theory to Implementation , 1991, Comput. Networks ISDN Syst..

[43]  Piotr Dembiński,et al.  Protocol Specification, Testing and Verification XV , 1996, IFIP Advances in Information and Communication Technology.

[44]  J. Davenport.  Editor , 1960 .

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

[46]  Nancy A. Lynch,et al.  Hierarchical correctness proofs for distributed algorithms , 1987, PODC '87.

[47]  L. Aceto.  Action refinement in process algebras , 1992 .

[48]  Guy Leduc,et al.  Failure-based congruences, unfair divergences and new testing theory , 1995, PSTV.

[49]  Son T. Vuong,et al.  A Metric Based Theory of Test Selection and Coverage , 1993, PSTV.

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

[51]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

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