Synthesizing Pareto Efficient Intelligible State Machines from Communication Diagram

Toshiyuki MIYAMOTO

IEICE TRANSACTIONS on Information and Systems   Vol.E100-D    No.6    pp.1200-1209
Publication Date: 2017/06/01
Publicized: 2017/03/07
Online ISSN: 1745-1361
DOI: 10.1587/transinf.2016FOP0002
Type of Manuscript: Special Section PAPER (Special Section on Formal Approach)
Category: Formal tools
unified modeling language,  choreography realization problem,  Petri nets,  automatic synthesis,  service-oriented architecture,  

Full Text: PDF>>
Buy this Article

For a service-oriented architecture based system, the problem of synthesizing a concrete model, i.e., behavioral model, for each service configuring the system from an abstract specification, which is referred to as choreography, is known as the choreography realization problem. In this paper, we assume that choreography is given by an acyclic relation. We have already shown that the condition for the behavioral model is given by lower and upper bounds of acyclic relations. Thus, the degree of freedom for behavioral models increases; developing algorithms of synthesizing an intelligible model for users becomes possible. In this paper, we introduce several metrics for intelligibility of state machines, and study the algorithm of synthesizing Pareto efficient state machines.