Generating candidates when testing a deterministic implementation against a non-deterministic finite-state machine

被引：15
作者：
Hierons, RM [1 ]
机构：
[1] Brunel Univ, Uxbridge UB8 3PH, Middx, England
来源：
COMPUTER JOURNAL | 2003年 / 46卷 / 03期
关键词：
D O I：
10.1093/comjnl/46.3.307
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper considers the problem of testing a deterministic system against a non-deterministic finite-state machine. An adaptive test process, with two phases, is proposed. The paper focuses on the first stage which involves testing to generate a candidate deterministic finite-state machine. This candidate has the property that, under the test hypotheses used, the implementation is correct if and only if it is equivalent to the candidate. A test may then be derived from the candidate.
引用
收藏
页码：307 / 318
页数：12
相关论文
共 21 条
[1]  
Boroday SY, 1998, TESTING OF COMMUNICATING SYSTEMS, P101
[2]   TESTING SOFTWARE DESIGN MODELED BY FINITE-STATE MACHINES [J].
CHOW, TS .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1978, 4 (03) :178-187
[3]  
COHEN DIA, 1997, INTRO COMPUTER THEOR
[4]  
Gaudel MC, 1995, LECT NOTES COMPUT SC, V915, P82
[5]  
Gill A., 1962, INTRO THEORY FINITE
[6]  
Harel D., 1998, MODELING REACTIVE SY
[7]  
Hennie F. C., 1964, P 5 ANN S SWITCH CIR, P95, DOI 10.1109/SWCT.1964.8
[8]   Adaptive testing of a deterministic implementation against a nondeterministic finite state machine [J].
Hierons, RM .
COMPUTER JOURNAL, 1998, 41 (05) :349-355
[9]  
*ITU T, 1997, REC Z 500 FRAM FORM
[10]  
ITU-T, 1999, REC Z 100 SPEC DESCR
123