Brunel University Research Archive(BURA) preserves and enables easy and open access to all
types of digital content. It showcases Brunel's research outputs.
Research contained within BURA is open access, although some publications may be subject
to publisher imposed embargoes. All awarded PhD theses are also archived on BURA.
Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/3391| Title: | Expanding an extended finite state machine to aid testability |
| Authors: | Hierons, RM Kim, TH Ural, H |
| Keywords: | Extended finite state machine;Testability;Infeasible paths |
| Issue Date: | 2002 |
| Publisher: | IEEE |
| Citation: | 26th IEEE Annual International Computer Software and Applications Conference (COMPSAC 2002), pp. 334-339, August 2002. |
| Abstract: | The problem of testing from an extended finite state machine (EFSM) is complicated by the presence of infeasible paths. This paper considers the problem of expanding an EFSM in order to bypass the infeasible path problem. The approach is developed for the specification language SDL but, in order to aid generality, the rewriting process is broken down into two phases: producing a normal form EFSM (NF-EFSM) from an SDL specification and then expanding this NF-EFSM. |
| URI: | http://bura.brunel.ac.uk/handle/2438/3391 |
| Appears in Collections: | Computer Science Dept of Computer Science Research Papers Software Engineering (B-SERC) |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Fulltext.pdf | 282.76 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.