Generating reduced finite state machine from concurrent scenarios using static partial order method

Finite state machine (FSM) representation is widely used to perform behavioral analysis and automatically generate test cases from a set of hierarchically organized scenarios written in Message Sequence Charts (MSCs). However, brute-force approach to translate MSCs into a FSM results in a large number of states and transitions. When scenarios are to be executed concurrently, as is often the case for reactive and embedded software systems, the number of transitions grows too quickly for the approach to remain practical. We proposed a state reduction method by encoding the values of configuration variables in states. In this paper, we demonstrate that partial order reduction technique is useful in reducing the number of transitions. We illustrate how to identify a sequence of message exchanges that are semantically equivalent. We have performed an experimental study using partial specification of digital TV software
Publisher
AUSTRALIAN COMPUTER SOC INC
Issue Date
2004
Language
ENG
Citation

JOURNAL OF RESEARCH AND PRACTICE IN INFORMATION TECHNOLOGY, v.36, no.3, pp.145 - 156

ISSN
1443-458X
URI
http://hdl.handle.net/10203/802
Appears in Collection
NE-Journal Papers(저널논문)
Files in This Item
Generating A Reduced Finite State Machine from Concurrent Scenarios using Static Partial Order Method.pdf(252.85 kB)Download
  • Hit : 469
  • Download : 258
  • Cited 0 times in thomson ci

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0