Abstract
The objective of testing is to determine whether an implementation under test conforms to its specification. In distributed test architectures involving multiple remote testers, this objective can be complicated by the fact that testers may encounter coordination problems relating to controllability (synchronization) and observability during the application of tests. Based on a finite state machine (FSM) specification of the externally observable behaviour of a distributed system and a distinguishing sequence, this paper proposes a method for constructing a checking sequence where there is no potential controllability or observability problems, and where the use of external coordination message exchanges among testers is minimized. The proposed method does not assume a reliable reset feature in the implementations of the given FSM to be tested by the resulting checking sequence.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Corresponding author
Additional information
phone: 613-562-5800(Extn)6684
Received May 2004
Revised March 2005
Accepted April 2005 by J. Derrick, M. Harman and R. M. Herons
Rights and permissions
About this article
Cite this article
Ural, H., Williams, C. Constructing checking sequences for distributed testing. Form Asp Comp 18, 84–101 (2006). https://doi.org/10.1007/s00165-005-0083-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00165-005-0083-8