IEICE TRANSACTIONS on Communications
An Approach for Testing Asynchronous Communicating Systems
Summary :
This paper studies the problem of testing concurrent systems considered as blackboxes and specified using asynchronous Communicating Finite State Machines. We present an approach to derive test cases for concurrent systems in a succinct and formal way. The approach addresses the state space explosion problem by introducing a causality relation model and the concept of logical time to express true concurrency and describe timing constraints on events. The conformance relation between test cases and trace observed from the real system is defined, and a new test architecture as well as a test case application is presented according to the conformance relation defined. To improve verdict capability of test cases, the approach is enhanced by relaxing the unit-time assumption to any natural number. And a computationally efficient algorithm for the enhanced approach is presented and the algorithm is evaluated in terms of computational efficiency and verdict capability. Finally the approach is generalized to describe timing constraints by any real numbers.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E82-B No.1 pp.81-95
- Publication Date
- 1999/01/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Signaling System and Communication Protocol
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Myungchul KIM, Jaehwi SHIN, Samuel T. CHANSON, Sungwon KANG, "An Approach for Testing Asynchronous Communicating Systems" in IEICE TRANSACTIONS on Communications,
vol. E82-B, no. 1, pp. 81-95, January 1999, doi: .
Abstract: This paper studies the problem of testing concurrent systems considered as blackboxes and specified using asynchronous Communicating Finite State Machines. We present an approach to derive test cases for concurrent systems in a succinct and formal way. The approach addresses the state space explosion problem by introducing a causality relation model and the concept of logical time to express true concurrency and describe timing constraints on events. The conformance relation between test cases and trace observed from the real system is defined, and a new test architecture as well as a test case application is presented according to the conformance relation defined. To improve verdict capability of test cases, the approach is enhanced by relaxing the unit-time assumption to any natural number. And a computationally efficient algorithm for the enhanced approach is presented and the algorithm is evaluated in terms of computational efficiency and verdict capability. Finally the approach is generalized to describe timing constraints by any real numbers.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e82-b_1_81/_p
Copy
@ARTICLE{e82-b_1_81,
author={Myungchul KIM, Jaehwi SHIN, Samuel T. CHANSON, Sungwon KANG, },
journal={IEICE TRANSACTIONS on Communications},
title={An Approach for Testing Asynchronous Communicating Systems},
year={1999},
volume={E82-B},
number={1},
pages={81-95},
abstract={This paper studies the problem of testing concurrent systems considered as blackboxes and specified using asynchronous Communicating Finite State Machines. We present an approach to derive test cases for concurrent systems in a succinct and formal way. The approach addresses the state space explosion problem by introducing a causality relation model and the concept of logical time to express true concurrency and describe timing constraints on events. The conformance relation between test cases and trace observed from the real system is defined, and a new test architecture as well as a test case application is presented according to the conformance relation defined. To improve verdict capability of test cases, the approach is enhanced by relaxing the unit-time assumption to any natural number. And a computationally efficient algorithm for the enhanced approach is presented and the algorithm is evaluated in terms of computational efficiency and verdict capability. Finally the approach is generalized to describe timing constraints by any real numbers.},
keywords={},
doi={},
ISSN={},
month={January},}
Copy
TY - JOUR
TI - An Approach for Testing Asynchronous Communicating Systems
T2 - IEICE TRANSACTIONS on Communications
SP - 81
EP - 95
AU - Myungchul KIM
AU - Jaehwi SHIN
AU - Samuel T. CHANSON
AU - Sungwon KANG
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E82-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 1999
AB - This paper studies the problem of testing concurrent systems considered as blackboxes and specified using asynchronous Communicating Finite State Machines. We present an approach to derive test cases for concurrent systems in a succinct and formal way. The approach addresses the state space explosion problem by introducing a causality relation model and the concept of logical time to express true concurrency and describe timing constraints on events. The conformance relation between test cases and trace observed from the real system is defined, and a new test architecture as well as a test case application is presented according to the conformance relation defined. To improve verdict capability of test cases, the approach is enhanced by relaxing the unit-time assumption to any natural number. And a computationally efficient algorithm for the enhanced approach is presented and the algorithm is evaluated in terms of computational efficiency and verdict capability. Finally the approach is generalized to describe timing constraints by any real numbers.
ER -
English
