The paper is devoted to the adaptive distinguishing experiments derivation for the following automata models: Labelled Transition Systems, nondeterministic, possibly partial, Finite State Machines and Timed Finite State Machines. The methods suggested here do not exploit "all weather condition" assumption and are based on the intersection of the corresponding automata. The experiments can be used for test derivation and diagnosis for discrete event systems.
Download file
Counter downloads: 74
- Title ADAPTIVE TESTS DERIVATION FOR NON-DETERMINISTIC AUTOMATA
- Headline ADAPTIVE TESTS DERIVATION FOR NON-DETERMINISTIC AUTOMATA
- Publesher
Tomsk State University - Issue Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics 4(6)
- Date:
- DOI
Keywords
входо-выходной полуавтомат с молчанием , конечный недетерминированный автомат , временной автомат , различимость , совместимость , условный эксперимент , Labelled Transition Systems , nondeterministic Finite State Machine , Timed Finite State Machine , distinguishing experiment , compatibility , adaptive experiment Authors
References
Куфарева И. Б. Применение недетерминированных автоматов в задачах синтеза проверяющих тестов для систем логического управления: автореф. дис. ... канд. техн. наук. Томск: Томский госуниверситет, 2000. 16 с.
Gromov M., Popov D., Yevtushenko N. Deriving test suites for timed Finite State Machines // Proceedings of IEEE East-West Design & Test Symposium'08, Kharkov: SPD FL Stepanov V.V., 2008. P. 339-343.
Евтушенко Н. В., Петренко А. Ф., Ветрова М. В. Недетерминрованные автоматы: Анализ и синтез. Ч. 1. Отношения и операции: учеб. пособие. Томск: Томский госуниверситет, 2006. 142 с.
Tretmans J. Test Generation with Inputs, Outputs and Repetitive Quiescence // Software - Concepts and Tools. 1996. V. 17. No. 3. P. 103-120.
Gill A. Introduction to the theory of Finite-State Machines. New York: McGraw-Hill, 1962.
Gromov M., Willemse T. Model-Based Testing Techniques for Diagnosis // Testing of Software and Communicating Systems. Berlin: Springer, 2007. P. 138-154.
Alur R., Courcoubetis С., Yannakakis M. Distinguishing tests for nondeterministic and probabilistic machines // STOC'95. New York: ACM, 1995. P. 363-372.
Merayo M., Núnez M., Rodriguez I. Formal Testing from Timed Finite State Machines // Computer Networks. 2008. V. 52. No. 3. P. 432-460.
Shabaldina N., El-Fakih K., Yevtushenko N. Testing Nondeterministic Finite State Machines with Respect to the Separability Relation // Testing of Software and Communicating Systems. Berlin: Springer, 2007. P. 305-318.
Hierons R. M. Testing from a Nondeterministic Finite State Machine Using Adaptive State Counting // IEEE Trans. Comput. 2004. V. 53. No. 10. P. 1330-1342.
Simāo A., Petrenko A. Generating Checking Sequences for Partial Reduced Finite State Machines // TestCom '08 / FATES '08. Berlin: Springer Verlag, 2008. P. 153-168.
Milner R. Communication and concurrency Upper Saddle River: Prentice-Hall, Inc., 1989.
ADAPTIVE TESTS DERIVATION FOR NON-DETERMINISTIC AUTOMATA | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2009. № 4(6).
Download full-text version
Download fileCounter downloads: 279