Synthesizing Pareto Efficient Intelligible State Machines from Communication Diagram
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Information 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
Authors
Toshiyuki MIYAMOTO
Osaka University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Toshiyuki MIYAMOTO, "Synthesizing Pareto Efficient Intelligible State Machines from Communication Diagram" in IEICE TRANSACTIONS on Information,
vol. E100-D, no. 6, pp. 1200-1209, June 2017, doi: 10.1587/transinf.2016FOP0002.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2016FOP0002/_p
Copy
@ARTICLE{e100-d_6_1200,
author={Toshiyuki MIYAMOTO, },
journal={IEICE TRANSACTIONS on Information},
title={Synthesizing Pareto Efficient Intelligible State Machines from Communication Diagram},
year={2017},
volume={E100-D},
number={6},
pages={1200-1209},
abstract={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.},
keywords={},
doi={10.1587/transinf.2016FOP0002},
ISSN={1745-1361},
month={June},}
Copy
TY - JOUR
TI - Synthesizing Pareto Efficient Intelligible State Machines from Communication Diagram
T2 - IEICE TRANSACTIONS on Information
SP - 1200
EP - 1209
AU - Toshiyuki MIYAMOTO
PY - 2017
DO - 10.1587/transinf.2016FOP0002
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E100-D
IS - 6
JA - IEICE TRANSACTIONS on Information
Y1 - June 2017
AB - 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.
ER -
English
