Please use this identifier to cite or link to this item: http://buratest.brunel.ac.uk/handle/2438/349
Title: On the testability of SDL specifications
Authors: Kim, KH
Ural, H
Hierons, RM
Keywords: SDL;Test generation;Extended finite state machine;Infeasible path problem
Issue Date: 2004
Publisher: Elsevier
Citation: Computer Networks: The International Journal of Computer and Telecommunications Networking, 44(5): 681 - 700, Apr 2004
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.
URI: http://portal.acm.org/citation.cfm?id=987153.987160
http://www.sciencedirect.com/science/journal/13891286
http://bura.brunel.ac.uk/handle/2438/349
DOI: http://dx.doi.org/10.1016/j.comnet.2003.06.001
Appears in Collections:Computer Science
Dept of Computer Science Research Papers
Software Engineering (B-SERC)

Files in This Item:
File Description SizeFormat 
On The Testability.pdf922.11 kBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.