Synthesizing Pareto Efficient Intelligible State Machines from Communication Diagram

• MIYAMOTO Toshiyuki

  Division of Electrical, Electronic and Information Engineering, Graduate School of Engineering, Osaka University

抄録

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.

収録刊行物

• IEICE Transactions on Information and Systems

  IEICE Transactions on Information and Systems E100.D (6), 1200-1209, 2017

  一般社団法人 電子情報通信学会

キーワード

• unified modeling language
• choreography realization problem
• Petri nets
• automatic synthesis
• service-oriented architecture

詳細情報

• CRID: 1390282679355761408
• NII論文ID: 130005687710
• DOI: 10.1587/transinf.2016fop0002
• ISSN: 17451361
• ISSN: 09168532
• Web Site: https://www.jstage.jst.go.jp/article/transinf/E100.D/6/E100.D_2016FOP0002/_pdf
• 本文言語コード: en
• データソース種別:
  • JaLC
  • Crossref
  • CiNii Articles
  • KAKEN
• 抄録ライセンスフラグ: 使用不可