| dc.creator |
Kim, KH |
|
| dc.creator |
Ural, H |
|
| dc.creator |
Hierons, RM |
|
| dc.date |
2006-11-06T11:40:06Z |
|
| dc.date |
2006-11-06T11:40:06Z |
|
| dc.date |
2004 |
|
| dc.date.accessioned |
2022-05-25T13:07:00Z |
|
| dc.date.available |
2022-05-25T13:07:00Z |
|
| dc.identifier |
Computer Networks: The International Journal of Computer and Telecommunications Networking, 44(5): 681 - 700, Apr 2004 |
|
| dc.identifier |
http://portal.acm.org/citation.cfm?id=987153.987160 |
|
| dc.identifier |
http://www.sciencedirect.com/science/journal/13891286 |
|
| dc.identifier |
http://bura.brunel.ac.uk/handle/2438/349 |
|
| dc.identifier |
http://dx.doi.org/10.1016/j.comnet.2003.06.001 |
|
| dc.identifier.uri |
http://localhost:8080/xmlui/handle/CUHPOERS/163680 |
|
| dc.description |
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. |
|
| dc.format |
373781 bytes |
|
| dc.format |
application/pdf |
|
| dc.language |
en |
|
| dc.publisher |
Elsevier |
|
| dc.subject |
SDL |
|
| dc.subject |
Test generation |
|
| dc.subject |
Extended finite state machine |
|
| dc.subject |
Infeasible path problem |
|
| dc.title |
On the testability of SDL specifications |
|
| dc.type |
Research Paper |
|
| dc.coverage |
29 |
|