Test derivation based on tree FSMs and tree automata

Autor:	Maria Forostyanova
Jazyk:	English<br />Russian
Rok vydání:	2018
Předmět:	telecommunication protocols extended finite state machine tcp l-equivalent Electronic computers. Computer science QA75.5-76.95
Zdroj:	Труды Института системного программирования РАН, Vol 26, Iss 6, Pp 67-76 (2018)
Druh dokumentu:	article
ISSN:	2079-8156 2220-6426
DOI:	10.15514/ISPRAS-2014-26(6)-6
Popis:	In this paper, an approach for testing software implementations of telecommunication protocols based on tree finite state machines (FSM) is proposed. The first step is the extraction of the specification Extended FSM from an informal protocol description. The next step is to derive a corresponding EFSM l-equivalent that is a tree FSM. Based on the set of considered faults corresponding sequences of the l-equivalent are included into a test suite. The proposed approach is illustrated by protocol TCP (Windows).
Databáze:	Directory of Open Access Journals
Externí odkaz:	https://doaj.org/article/48e2a0a05db8461eb46e16c8d5036d3b Zobrazit plný text záznamu View record in DOAJ