Abstract
In this paper we present a new kind of testing, namely friendly testing, which has been developed to obtain a satisfactory conformance relation sharing the good properties of the more popular conformance relations, that is must-testing and conf, while avoiding their respective problems. In particular, our friendly tests cannot punish a process when it is able to execute some action, while classical testing did it. This was a clear drawback of must testing when considered as a conformance relation. Finally, We prove that the preorder induced by friendly testing is just the transitive closure of conf. As a consequence we obtain an interesting characterization of this closure, from which we derive several its properties.
Keywords
Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Brinksma, E [ 1988 ], A theory for the derivation of tests, in ‘Protocol Specification, Testing and Verification VIII’, pp. 63–74.
Brinksma, E., Scollo, G. and Steenbergen, C. [ 1986 ], LOTOS specifications, their implementations and their tests, in ‘Protocol Specification, Testing and Verification VI’, pp. 349–360.
Cavalli, A., Favreau, J. and Phalippou, M. [ 1996 ], ‘Standardization of formal methods in conformance testing of communication protocols’, Computer Networks and ISDN Systems 29, 3–14.
Frutos-Escrig, D., Llana-Diaz, L. and Núíiez, M. [1997], Introducing friendly testing, Technical Report DIA 53/97, Dept. Informatica y Automatica. Universidad Complutense de Madrid.
de Nicola, R. and Hennessy, M. [1984], Testing equivalences for processes’, Theoretical Computer Science 34, 83–133.
Hennessy, M. [1988], Algebraic Theory of Processes,MIT Press.
Hoare, C. [1985], Communicating Sequential Processes,Prentice Hall. JTC1/SC21/WG1/Project 54.1 [1995a], ‘FMCT guidelines on Test Generation Methods from Formal Descriptions’.
JTC1/SC21/WG1/Project 54.1 [1995b],Working Draft on “Framework: Formal Methods in Conformance Testing’.
Leduc, G. [ 1991 ], Conformance relation, associated equivalence, and minimum canonical tester in LOTOS, in ‘Protocol Specification, Testing and Verification XI’, pp. 249–264.
Leduc, G. [ 1992 ], ‘A framework based on implementation relations for implementing LOTOS specifications’, Computer Networks and ISDN Systems 25(1), 23–41.
Tretmans, J. [ 1996 ], ‘Conformance testing with labelled transition systems: Implementation relations and test generation’, Computer Networks and ISDN Systems 29, 49–79.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
de Frutos-Escrig, D., Llana-Díaz, L., Núñez, M. (1997). Friendly Testing as a Conformance Relation. In: Mizuno, T., Shiratori, N., Higashino, T., Togashi, A. (eds) Formal Description Techniques and Protocol Specification, Testing and Verification. IFIP — The International Federation for Information Processing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35271-8_18
Download citation
DOI: https://doi.org/10.1007/978-0-387-35271-8_18
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-5260-1
Online ISBN: 978-0-387-35271-8
eBook Packages: Springer Book Archive