%0 Conference Proceedings
%T Conformance Relations for Distributed Testing Based on CSP
%+ University of York [York, UK]
%+ Laboratoire de Recherche en Informatique (LRI)
%+ Brunel University London [Uxbridge]
%A Cavalcanti, Ana
%A Gaudel, Marie-Claude
%A Hierons, Robert, M.
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 23th International Conference on Testing Software and Systems (ICTSS)
%C Paris, France
%Y Burkhart Wolff
%Y Fatiha Zaïdi
%I Springer
%3 Testing Software and Systems
%V LNCS-7019
%P 48-63
%8 2011-11-07
%D 2011
%R 10.1007/978-3-642-24580-0_5
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X CSP is a well established process algebra that provides comprehensive theoretical and practical support for refinement-based design and verification of systems. Recently, a testing theory for CSP has also been presented. In this paper, we explore the problem of testing from a CSP specification when observations are made by a set of distributed testers. We build on previous work on input-output transition systems, but the use of CSP leads to significant differences, since some of its conformance (refinement) relations consider failures as well as traces. In addition, we allow events to be observed by more than one tester. We show how the CSP notions of refinement can be adapted to distributed testing. We consider two contexts: when the testers are entirely independent and when they can cooperate. Finally, we give some preliminary results on test-case generation and the use of coordination messages.
%G English
%Z TC 6
%Z WG 6.1
%2 https://inria.hal.science/hal-01583923/document
%2 https://inria.hal.science/hal-01583923/file/978-3-642-24580-0_5_Chapter.pdf
%L hal-01583923
%U https://inria.hal.science/hal-01583923
%~ EC-PARIS
%~ CNRS
%~ UNIV-PSUD
%~ UMR8623
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-ICTSS
%~ UNIV-PARIS-SACLAY
%~ UNIV-PSUD-SACLAY
%~ IFIP-LNCS-7019