Realizability of Choreography Given by Two Scenarios

• KINOSHITA Toshiki

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

• 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 peer configuring the system from an abstract specification-which is referred to as choreography-is known as the choreography realization problem. A flow of interaction of peers is called a scenario. In our previous study, we showed conditions and an algorithm to synthesize concrete models when choreography is given by one scenario. In this paper, we extend the study for choreography given by two scenarios. We show necessary and sufficient conditions on the realizability of choreography under both cases where there exist conflicts between scenarios and no conflicts exist.

収録刊行物

• IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

  IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E101.A (2), 345-356, 2018

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

キーワード

• SOA
• model-based development
• communication diagram
• state machine
• choreography realization problem

詳細情報

• CRID: 1390001206313708928
• NII論文ID: 130006327983
• DOI: 10.1587/transfun.e101.a.345
• ISSN: 17451337
• ISSN: 09168508
• Web Site: https://www.jstage.jst.go.jp/article/transfun/E101.A/2/E101.A_345/_pdf
• 本文言語コード: en
• データソース種別:
  • JaLC
  • Crossref
  • CiNii Articles
  • KAKEN
• 抄録ライセンスフラグ: 使用不可