Test derivation based on tree FSMs and tree automata
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 E...
Main Author: | Maria Forostyanova |
---|---|
Format: | Article |
Language: | English |
Published: |
Ivannikov Institute for System Programming of the Russian Academy of Sciences
2018-10-01
|
Series: | Труды Института системного программирования РАН |
Subjects: | |
Online Access: | https://ispranproceedings.elpub.ru/jour/article/view/863 |
Similar Items
-
Encoding of Terms in EMB-Based Mealy FSMs
by: Alexander Barkalov, et al.
Published: (2020-04-01) -
Network tomography based on flow level measurements
by: Arifler, Dogu
Published: (2008) -
Improving Characteristics of LUT-Based Mealy FSMs with Twofold State Assignment
by: Alexander Barkalov, et al.
Published: (2021-04-01) -
Verification of Telecommunication Systems Specified
by Communicating Finite Automata with the Help
of Coloured Petri Nets
by: D. M. Beloglazov, et al.
Published: (2011-12-01) -
Best-effort traffic engineering in multiprotocol label switched networks
by: Koehler, Bernd G.
Published: (2007)