Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/357
Title: | Checking states and transitions of a set of communicating finite state machines |
Authors: | Hierons, RM |
Keywords: | Communicating finite state machines;State checking;Testing;Constrained identification sequences |
Issue Date: | 2001 |
Publisher: | Elsevier Science |
Citation: | Hierons. R.M. (2001) 'Checking states and transitions of a set of communicating finite state machines', Microprocessors and Microsystems, 24(9), pp. 443-452. doi:10.1016/S0141-9331(00)00097-1. |
Abstract: | This paper considers the problem of testing to check the transitions of implementation I against those of a model M consisting of communicating finite state machines. One approach is to generate the product machine from M and then apply standard finite state machine test techniques. This approach may, however, suffer from a combinatorial explosion. Instead, this paper introduces approaches that may allow local states and transitions of I to be checked without the generation of the product machine. The paper then extends these approaches to the checking of global states. |
URI: | http://bura.brunel.ac.uk/handle/2438/357 |
DOI: | https://doi.org/10.1016/s0141-9331(00)00097-1 |
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 | 405.72 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.