A TEST-GENERATION ALGORITHM FOR SYSTEMS MODELED AS NONDETERMINISTIC FSMS

被引：12
作者：
ABOELFOTOH, H
ABOURABIA, O
URAL, H
机构：
[1] AMER UNIV CAIRO,DEPT COMP SCI,CAIRO,EGYPT
[2] LAURENTIAN UNIV,DEPT MATH & COMP SCI,SUDBURY P3E 2C6,ONTARIO,CANADA
[3] UNIV OTTAWA,DEPT COMP SCI,OTTAWA K1N 6N5,ONTARIO,CANADA
来源：
SOFTWARE ENGINEERING JOURNAL | 1993年 / 8卷 / 04期
关键词：
D O I：
10.1049/sej.1993.0024
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
A variety of systems can be modelled as finite-state machines (FSM). Several formal methods have been proposed for testing the conformance of an implementation to a given FSM-based specification. However, all of these methods assume that the specification is modelled by a deterministic FSM. This paper presents an efficient algorithm that generates a set of adaptive all state-pair optimised distinguishing sequences for testing systems modelled as non-deterministic FSMs.
引用
收藏
页码：184 / 188
页数：5
相关论文
共 13 条
[1]  
AHO AV, 1991, IEEE T CON, V39, P1605
[2]   TESTING SOFTWARE DESIGN MODELED BY FINITE-STATE MACHINES [J].
CHOW, TS .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1978, 4 (03) :178-187
[3]   FORMAL METHODS FOR GENERATING PROTOCOL CONFORMANCE TEST SEQUENCES [J].
DAHBURA, AT ;
SABNANI, KK ;
UYAR, MU .
PROCEEDINGS OF THE IEEE, 1990, 78 (08) :1317-1326
[4]   TEST SELECTION BASED ON FINITE STATE MODELS [J].
FUJIWARA, S ;
BOCHMANN, GV ;
KHENDEK, F ;
AMALOU, M ;
GHEDAMSI, A .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1991, 17 (06) :591-603
[5]  
Gill A., 1962, INTRO THEORY FINITE
[6]   A METHOD FOR DESIGN OF FAULT DETECTION EXPERIMENTS [J].
GONENC, G .
IEEE TRANSACTIONS ON COMPUTERS, 1970, C 19 (06) :551-+
[7]  
HENNIE FC, 1964, 5TH P ANN S SWITCH C, P95
[8]  
Kohavi Z., 1978, SWITCHING FINITE AUT
[9]  
Moore E. F., 1956, AUTOMATA STUDIES, P129
[10]   A PROTOCOL TEST-GENERATION PROCEDURE [J].
SABNANI, K ;
DAHBURA, A .
COMPUTER NETWORKS AND ISDN SYSTEMS, 1988, 15 (04) :285-297
12