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

Kazuhide Dougome; Keijiro Araki

doi:10.1109/TENCON.2010.5685918

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

Kazuhide Dougome, Keijiro Araki

Advanced Software Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English
Title of host publication	TENCON 2010 - 2010 IEEE Region 10 Conference
Pages	2438-2443
Number of pages	6
DOIs	https://doi.org/10.1109/TENCON.2010.5685918
Publication status	Published - 2010
Event	2010 IEEE Region 10 Conference, TENCON 2010 - Fukuoka, Japan Duration: Nov 21 2010 → Nov 24 2010

Publication series

Name	IEEE Region 10 Annual International Conference, Proceedings/TENCON

Other

Other	2010 IEEE Region 10 Conference, TENCON 2010
Country/Territory	Japan
City	Fukuoka
Period	11/21/10 → 11/24/10

All Science Journal Classification (ASJC) codes

Computer Science Applications
Electrical and Electronic Engineering

Access to Document

10.1109/TENCON.2010.5685918

Cite this

@inproceedings{8d9f959d855b434da2782bf029150f6c,

title = "Synthesizing state-based objects from a regular set of action sequences",

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.",

author = "Kazuhide Dougome and Keijiro Araki",

year = "2010",

doi = "10.1109/TENCON.2010.5685918",

language = "English",

isbn = "9781424468904",

series = "IEEE Region 10 Annual International Conference, Proceedings/TENCON",

pages = "2438--2443",

booktitle = "TENCON 2010 - 2010 IEEE Region 10 Conference",

note = "2010 IEEE Region 10 Conference, TENCON 2010 ; Conference date: 21-11-2010 Through 24-11-2010",

}

TY - GEN

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

AU - Dougome, Kazuhide

AU - Araki, Keijiro

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

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

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

U2 - 10.1109/TENCON.2010.5685918

DO - 10.1109/TENCON.2010.5685918

M3 - Conference contribution

AN - SCOPUS:79951607561

SN - 9781424468904

T3 - IEEE Region 10 Annual International Conference, Proceedings/TENCON

SP - 2438

EP - 2443

BT - TENCON 2010 - 2010 IEEE Region 10 Conference

T2 - 2010 IEEE Region 10 Conference, TENCON 2010

Y2 - 21 November 2010 through 24 November 2010

ER -

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

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this