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

Kazuhide Dougome, Keijiro Araki

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


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
Number of pages6
Publication statusPublished - 2010
Event2010 IEEE Region 10 Conference, TENCON 2010 - Fukuoka, Japan
Duration: Nov 21 2010Nov 24 2010

Publication series

NameIEEE Region 10 Annual International Conference, Proceedings/TENCON


Other2010 IEEE Region 10 Conference, TENCON 2010

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Electrical and Electronic Engineering


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