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

Nam Hee Lee, Sungdeok Cha

Research output: Contribution to journalArticle

Abstract

Finite state machine (FSM) representation is widely used to perform behavioural analysis and generate test cases from a set of hierarchically organized scenarios written in Message Sequence Charts (MSCs). Brute-force approach of translating MSCs into FSM is impractical, especially when scenarios are executed concurrently. In this paper, we describe how to identify a sequence of message exchanges that are semantically equivalent and apply partial order method to reduce the number of transitions in the FSM. We demonstrate that the proposed technique is scalable by describing the results of a case study in which reduced FSM was automatically generated from a partial specification of digital TV software.

Original languageEnglish
Pages (from-to)145-156
Number of pages12
JournalJournal of Research and Practice in Information Technology
Volume36
Issue number3
Publication statusPublished - 2004 Sep 20
Externally publishedYes

Fingerprint

Finite automata
Specifications
Scenarios
Partial order
Charts

ASJC Scopus subject areas

  • Information Systems
  • Computer Graphics and Computer-Aided Design
  • Software

Cite this

@article{8c1ae9274c7042c7b3bdf4b4fa0aabf3,
title = "Generating reduced finite state machine from concurrent scenarios using static partial order method",
abstract = "Finite state machine (FSM) representation is widely used to perform behavioural analysis and generate test cases from a set of hierarchically organized scenarios written in Message Sequence Charts (MSCs). Brute-force approach of translating MSCs into FSM is impractical, especially when scenarios are executed concurrently. In this paper, we describe how to identify a sequence of message exchanges that are semantically equivalent and apply partial order method to reduce the number of transitions in the FSM. We demonstrate that the proposed technique is scalable by describing the results of a case study in which reduced FSM was automatically generated from a partial specification of digital TV software.",
author = "Lee, {Nam Hee} and Sungdeok Cha",
year = "2004",
month = "9",
day = "20",
language = "English",
volume = "36",
pages = "145--156",
journal = "Journal of Research and Practice in Information Technology",
issn = "1443-458X",
publisher = "Australian Computer Society",
number = "3",

}

TY - JOUR

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

AU - Lee, Nam Hee

AU - Cha, Sungdeok

PY - 2004/9/20

Y1 - 2004/9/20

N2 - Finite state machine (FSM) representation is widely used to perform behavioural analysis and generate test cases from a set of hierarchically organized scenarios written in Message Sequence Charts (MSCs). Brute-force approach of translating MSCs into FSM is impractical, especially when scenarios are executed concurrently. In this paper, we describe how to identify a sequence of message exchanges that are semantically equivalent and apply partial order method to reduce the number of transitions in the FSM. We demonstrate that the proposed technique is scalable by describing the results of a case study in which reduced FSM was automatically generated from a partial specification of digital TV software.

AB - Finite state machine (FSM) representation is widely used to perform behavioural analysis and generate test cases from a set of hierarchically organized scenarios written in Message Sequence Charts (MSCs). Brute-force approach of translating MSCs into FSM is impractical, especially when scenarios are executed concurrently. In this paper, we describe how to identify a sequence of message exchanges that are semantically equivalent and apply partial order method to reduce the number of transitions in the FSM. We demonstrate that the proposed technique is scalable by describing the results of a case study in which reduced FSM was automatically generated from a partial specification of digital TV software.

UR - http://www.scopus.com/inward/record.url?scp=4444226757&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=4444226757&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:4444226757

VL - 36

SP - 145

EP - 156

JO - Journal of Research and Practice in Information Technology

JF - Journal of Research and Practice in Information Technology

SN - 1443-458X

IS - 3

ER -