On the testability of SDL specifications
- Authors
- Hierons, RM; Kim, TH; Ural, H
- Issue Date
- 5-Apr-2004
- Publisher
- ELSEVIER SCIENCE BV
- Keywords
- SDL; test generation; extended finite state machine; infeasible path problem
- Citation
- COMPUTER NETWORKS, v.44, no.5, pp 681 - 700
- Pages
- 20
- Journal Title
- COMPUTER NETWORKS
- Volume
- 44
- Number
- 5
- Start Page
- 681
- End Page
- 700
- URI
- https://scholarworks.bwise.kr/kumoh/handle/2020.sw.kumoh/27003
- DOI
- 10.1016/j.comnet.2003.06.001
- ISSN
- 1389-1286
1872-7069
- Abstract
- The problem of testing from an SDL specification is often complicated by the presence of infeasible paths. This paper introduces an approach for transforming a class of SDL specification in order to eliminate or reduce the infeasible path problem. This approach is divided into two phases in order to aid generality. First the SDL specification is rewritten to create a normal form extended finite state machine (NF-EFSM). This NF-EFSM is then expanded in order to produce a state machine in which the test criterion may be satisfied using paths that are known to be feasible. The expansion process is guaranteed to terminate. Where the expansion process may lead to an excessively large state machine, this process may be terminated early and feasible paths added. The approach is illustrated through being applied to the Initiator process of the Inres protocol. (C) 2004 Elsevier B.V. All rights reserved.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - ETC > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.