Synthesis of Distinguishing Test Cases for Timed Finite State Machines

被引:1
作者
Gromov, M. L. [1 ]
Yevtushenko, N. V. [1 ]
机构
[1] Tomsk State Univ, Tomsk 634050, Russia
关键词
DETERMINISTIC IMPLEMENTATION;
D O I
10.1134/S0361768810040043
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
This paper is devoted to the generation of distinguishing experiments with completely specified timed finite state machines. It is shown, in particular, that two completely specified nondeterministic finite state machines can be distinguished by a multiple preset experiment if and only if these finite state machines are not equivalent. Two finite state machines can be distinguished by a simple adaptive experiment if and only if they are r-distinguishable, i.e., have no common completely specified reduction. The corresponding adaptive experiment is described by a special timed finite state machine. The procedure for constructing such an r-distinguishing timed finite state machine is proposed.
引用
收藏
页码:216 / 224
页数:9
相关论文
共 18 条
[1]   A THEORY OF TIMED AUTOMATA [J].
ALUR, R ;
DILL, DL .
THEORETICAL COMPUTER SCIENCE, 1994, 126 (02) :183-235
[2]  
Alur R., 1995, Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, P363, DOI 10.1145/225058.225161
[3]   Timed Wp-method: Testing real-time systems [J].
En-Nouaary, A ;
Dssouli, R ;
Khendek, F .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 2002, 28 (11) :1023-1038
[4]  
Gromov ML, 2008, VESTN TOMSK GOS U-UP, V4, P85
[5]  
Gromov M, 2009, LECT NOTES COMPUT SC, V5522, P137, DOI 10.1007/978-3-642-02138-1_9
[6]   Testing from a nondeterministic finite state machine using adaptive state counting [J].
Hierons, RM .
IEEE TRANSACTIONS ON COMPUTERS, 2004, 53 (10) :1330-1342
[7]   Generating candidates when testing a deterministic implementation against a non-deterministic finite-state machine [J].
Hierons, RM .
COMPUTER JOURNAL, 2003, 46 (03) :307-318
[8]   Adaptive testing of a deterministic implementation against a nondeterministic finite state machine [J].
Hierons, RM .
COMPUTER JOURNAL, 1998, 41 (05) :349-355
[9]  
Kohavi Z., 1978, Switching and Finite Automata Theory, V2nd
[10]  
KONDRATEVA OV, 2010, 6 ALL SIB C WOM MATH, P210