ADAPTIVE TESTS DERIVATION FOR NON-DETERMINISTIC AUTOMATA

被引：0
作者：
Gromov, M. L. [1 ]
Yevtushenko, N., V [1 ]
机构：
[1] Tomsk State Univ, Tomsk, Russia
来源：
PRIKLADNAYA DISKRETNAYA MATEMATIKA | 2009年 / 6卷 / 04期
关键词：
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
引用
收藏
页码：90 / 101
页数：12
相关论文
共 12 条
  • [1] Alur R., 1995, Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, P363, DOI 10.1145/225058.225161
  • [2] Gill A., 1962, INTRO THEORY FINITE
  • [3] Gromov M., 2008, P IEEE E W DES TEST, P339
  • [4] Gromov M, 2007, LECT NOTES COMPUT SC, V4581, P138
  • [5] Testing from a nondeterministic finite state machine using adaptive state counting
    Hierons, RM
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 2004, 53 (10) : 1330 - 1342
  • [6] KUFAREVA IB, 2000, THESIS
  • [7] Formal testing from timed finite state machines
    Merayo, Mercedes G.
    Nunez, Manuel
    Rodriguez, Ismael
    [J]. COMPUTER NETWORKS, 2008, 52 (02) : 432 - 460
  • [8] Milner R., 1989, Communication and concurrency
  • [9] Shabaldina N, 2007, LECT NOTES COMPUT SC, V4581, P305
  • [10] SIMAO A, 2008, TESTCOM 08 FATES 08, V5047, P153
12