Synthesizing state-based objects from a regular set of action sequences

Kazuhide Dougome, Keijiro Araki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We have developed a method and a suit of software tools which can transform a set of message sequence charts into the state transition diagrams and the executable programs for the involved objects. The basis of our method is a regular expression over a set of actions, named the regular trace. In this paper, we define the regular trace at first, and then discuss the method for producing a concrete program from the regular trace. For this purpose, we utilized the generalized finite automaton as an intermediate representation of the object, and applied some well-known algorithms in the formal language theory. At last, we report the outline of our software tools and its application example.

Original languageEnglish
Title of host publicationTENCON 2010 - 2010 IEEE Region 10 Conference
Pages2438-2443
Number of pages6
DOIs
Publication statusPublished - Dec 1 2010
Event2010 IEEE Region 10 Conference, TENCON 2010 - Fukuoka, Japan
Duration: Nov 21 2010Nov 24 2010

Other

Other2010 IEEE Region 10 Conference, TENCON 2010
CountryJapan
CityFukuoka
Period11/21/1011/24/10

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Synthesizing state-based objects from a regular set of action sequences'. Together they form a unique fingerprint.

  • Cite this

    Dougome, K., & Araki, K. (2010). Synthesizing state-based objects from a regular set of action sequences. In TENCON 2010 - 2010 IEEE Region 10 Conference (pp. 2438-2443). [5685918] https://doi.org/10.1109/TENCON.2010.5685918