scispace - formally typeset
Journal ArticleDOI

Controllability and observability in distributed testing

Leo Cacciari, +1 more
- 15 Sep 1999 - 
- Vol. 41, Iss: 11, pp 767-780
Reads0
Chats0
TLDR
Conformance testing approaches are required for gaining confidence in final products and guaranteeing their integration and interoperability within open distributed environment, and ideas gained from the experience with protocol testing are examined.
Abstract
In developing distributed systems, current trends are towards creating open distributed environments supporting interworking, interoperability, and portability, in spite of heterogeneity and autonomy of related systems. Several reference models, architectures and frameworks such as ODP, CORBA, and TINA, have already been designed and proposed. However, even though models, architectures, and frameworks, provide a good basis for developing working open distributed applications, conformance testing approaches are required for gaining confidence in final products and guaranteeing their integration and interoperability within open distributed environment. ODP provides some preliminary statements on conformance assessment in open distributed systems, but considerable work needs to be done before reaching a workable and accepted conformance testing methodology for open distributed processing. Further, ISO, ITU, OMG, and TINA-C, have recently recognized the urgent need for conformance testing. In this paper, we examine ideas gained from our experience with protocol testing, which may contribute to the design of such a framework. Our methodology is essentially guided by two features that have a great influence on all aspects of the testing process: controllability and observability.

read more

Citations
More filters
Journal ArticleDOI

Coordination Algorithm for Distributed Testing

TL;DR: This paper shows how to cope with problems of controllability and observability influencing fault detection during the testing process, arise if there is no coordination between the testers by using test coordination procedures in a distributed testing architecture.
Journal ArticleDOI

A temporal approach for testing distributed systems

TL;DR: It is shown that controllability and observability are indeed resolved if and only if the test system respects timing constraints, even when the system under test is non-real-time.
Journal ArticleDOI

Testing a distributed system: generating minimal synchronised test sequences that detect output-shifting faults

TL;DR: This paper considers the problem of generating a minimal synchronised test sequence that detects output-shifting faults when the system is specified using a finite state machine with multiple ports.
Journal ArticleDOI

Oracles for Distributed Testing

TL;DR: It is shown that the oracle problem can be solved in polynomial time but is NP-hard for the stronger notion of conformance (⊆w), even if the FSM is deterministic and nondeterministic, and for two alternative definitions of conformity for distributed testing.
Journal ArticleDOI

A survey on formal active and passive testing with applications to the cloud

TL;DR: A survey covering the main approaches to formal testing is presented, distinguish between active and passive approaches, and some of the work on testing the cloud and on testing in the cloud is reviewed.
References
More filters
Book

The Z notation: a reference manual

TL;DR: Tutorial introduction background the Z language the mathematical tool-kit sequential systems syntax summary and how to use it to solve sequential systems problems.
Book

Software Testing Techniques

Boris Beizer
Journal ArticleDOI

Introduction to the ISO specification language LOTOS

TL;DR: LOTOS is a specification language that has been specifically developed for the formal description of the OSI (Open Systems Interconnection) architecture, although it is applicable to distributed, concurrent systems in general.
Book

Switching and Finite Automata Theory

TL;DR: Theories are made easier to understand with 200 illustrative examples, and students can test their understanding with over 350 end-of-chapter review questions.
Journal ArticleDOI

Matching, euler tours and the chinese postman

TL;DR: The solution of the Chinese postman problem using matching theory is given and the convex hull of integer solutions is described as a linear programming polyhedron, used to show that a good algorithm gives an optimum solution.
Related Papers (5)