Please use this identifier to cite or link to this item:
Title: Conformance relations for distributed testing based on CSP
Authors: Cavalcanti, A
Gaudel, MC
Hierons, RM
Issue Date: 2011
Publisher: Springer Berlin Heidelberg
Citation: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7019: 48 - 63, 2011
Abstract: 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. © 2011 IFIP International Federation for Information Processing.
Description: Copyright @ 2011 Springer Berlin Heidelberg
ISBN: 978-3-642-24579-4
ISSN: 0302-9743
Appears in Collections:Publications
Computer Science
Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
distributedConformance.pdf158.55 kBAdobe PDFView/Open

Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.