Extending test sequence overlap by invertibility

被引：20

作者：

Hierons, RM

机构：

[1] Department of Mathematics, Goldsmith's College, University of London, London SE14 6NW, New Cross

来源：

COMPUTER JOURNAL | 1996年 / 39卷 / 04期

关键词：

D O I：

10.1093/comjnl/39.4.325

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Finite state automata can be used to model a system; in particular they can be used to model the control section of a communications protocol. A number of authors have produced algorithms that represent the problem of minimizing the testing against a finite state automaton model as a max flow/min cost problem for an associated network. We extend this work by introducing the use of invertibility to utilize test sequence overlap.

引用

页码：325 / 330

页数：6

共 16 条

[1]

Aho A. V., 1988, P IEEE 8 INT S PROT, P75

[2]

CHANSON ST, 1990, PROTOCOL SPECIFICATI, V9, P101

[3] TESTING SOFTWARE DESIGN MODELED BY FINITE-STATE MACHINES [J].

CHOW, TS .

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1978, 4 (03) :178-187

[4]

Edmonds J., 1973, Mathematical Programming, V5, P88, DOI 10.1007/BF01580113

[5] THEORETICAL IMPROVEMENTS IN ALGORITHMIC EFFICIENCY FOR NETWORK FLOW PROBLEMS [J].

EDMONDS, J ;

KARP, RM .

JOURNAL OF THE ACM, 1972, 19 (02) :248-&

[6]

Gibbons A., 1985, ALGORITHMIC GRAPH TH

[7]

HENNIE FC, 1964, 5TH P ANN S SWITCH C, P95

[8]

HIERONS RM, 1993, THESIS BRUNEL U UK

[9]

KOHAVI Z, 1970, SWITCHING FINITE AUT

[10]

Moore E., 1956, Automata Studies, V34, P129, DOI [10.1515/9781400882618-006, DOI 10.1515/9781400882618-006]

← 1 2 →