A Formal Model to Enforce Trustworthiness Requirements in Service Composition

Ning FU; Yingfeng ZHANG; Lijun SHAN; Zhiqiang LIU; Han PENG

doi:10.1587/transinf.2016EDP7400

A Formal Model to Enforce Trustworthiness Requirements in Service Composition

Ning FU, Yingfeng ZHANG, Lijun SHAN, Zhiqiang LIU, Han PENG

Full Text Views

0

Cite this

Summary :

With the in-depth development of service computing, it has become clear that when constructing service applications in an open dynamic network environment, greater attention must be paid to trustworthiness under the premise of functions' realization. Trustworthy computing requires theories for business process modeling in terms of both behavior and trustworthiness. In this paper, a calculus for ensuring the satisfaction of trustworthiness requirements in service-oriented systems is proposed. We investigate a calculus called QPi, for representing both the behavior and the trustworthiness property of concurrent systems. QPi is the combination of pi-calculus and a constraint semiring, which has a feature when problems with multi-dimensional properties must be tackled. The concept of the quantified bisimulation of processes provides us a measure of the degree of equivalence of processes based on the bisimulation distance. The QPi related properties of bisimulation and bisimilarity are also discussed. A specific modeling example is given to illustrate the effectiveness of the algebraic method.

Publication: IEICE TRANSACTIONS on Information Vol.E100-D No.9 pp.2056-2067

Publication Date: 2017/09/01

Publicized: 2017/06/20

Online ISSN: 1745-1361

DOI: 10.1587/transinf.2016EDP7400

Type of Manuscript: PAPER

Category: Software System

Authors

Ning FU
  Northwestern Polytechnical University
Yingfeng ZHANG
  Northwestern Polytechnical University
Lijun SHAN
  Northwestern Polytechnical University
Zhiqiang LIU
  Northwestern Polytechnical University
Han PENG
  Northwestern Polytechnical University

Keyword

trustworthy software, process algebra, pi-calculus, Q-algebra, semi-ring

Cite this

Copy

Ning FU, Yingfeng ZHANG, Lijun SHAN, Zhiqiang LIU, Han PENG, "A Formal Model to Enforce Trustworthiness Requirements in Service Composition" in IEICE TRANSACTIONS on Information, vol. E100-D, no. 9, pp. 2056-2067, September 2017, doi: 10.1587/transinf.2016EDP7400.
Abstract: With the in-depth development of service computing, it has become clear that when constructing service applications in an open dynamic network environment, greater attention must be paid to trustworthiness under the premise of functions' realization. Trustworthy computing requires theories for business process modeling in terms of both behavior and trustworthiness. In this paper, a calculus for ensuring the satisfaction of trustworthiness requirements in service-oriented systems is proposed. We investigate a calculus called QPi, for representing both the behavior and the trustworthiness property of concurrent systems. QPi is the combination of pi-calculus and a constraint semiring, which has a feature when problems with multi-dimensional properties must be tackled. The concept of the quantified bisimulation of processes provides us a measure of the degree of equivalence of processes based on the bisimulation distance. The QPi related properties of bisimulation and bisimilarity are also discussed. A specific modeling example is given to illustrate the effectiveness of the algebraic method.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2016EDP7400/_p

Copy

@ARTICLE{e100-d_9_2056,
author={Ning FU, Yingfeng ZHANG, Lijun SHAN, Zhiqiang LIU, Han PENG, },
journal={IEICE TRANSACTIONS on Information},
title={A Formal Model to Enforce Trustworthiness Requirements in Service Composition},
year={2017},
volume={E100-D},
number={9},
pages={2056-2067},
abstract={With the in-depth development of service computing, it has become clear that when constructing service applications in an open dynamic network environment, greater attention must be paid to trustworthiness under the premise of functions' realization. Trustworthy computing requires theories for business process modeling in terms of both behavior and trustworthiness. In this paper, a calculus for ensuring the satisfaction of trustworthiness requirements in service-oriented systems is proposed. We investigate a calculus called QPi, for representing both the behavior and the trustworthiness property of concurrent systems. QPi is the combination of pi-calculus and a constraint semiring, which has a feature when problems with multi-dimensional properties must be tackled. The concept of the quantified bisimulation of processes provides us a measure of the degree of equivalence of processes based on the bisimulation distance. The QPi related properties of bisimulation and bisimilarity are also discussed. A specific modeling example is given to illustrate the effectiveness of the algebraic method.},
keywords={},
doi={10.1587/transinf.2016EDP7400},
ISSN={1745-1361},
month={September},}

Copy

TY - JOUR
TI - A Formal Model to Enforce Trustworthiness Requirements in Service Composition
T2 - IEICE TRANSACTIONS on Information
SP - 2056
EP - 2067
AU - Ning FU
AU - Yingfeng ZHANG
AU - Lijun SHAN
AU - Zhiqiang LIU
AU - Han PENG
PY - 2017
DO - 10.1587/transinf.2016EDP7400
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E100-D
IS - 9
JA - IEICE TRANSACTIONS on Information
Y1 - September 2017
AB - With the in-depth development of service computing, it has become clear that when constructing service applications in an open dynamic network environment, greater attention must be paid to trustworthiness under the premise of functions' realization. Trustworthy computing requires theories for business process modeling in terms of both behavior and trustworthiness. In this paper, a calculus for ensuring the satisfaction of trustworthiness requirements in service-oriented systems is proposed. We investigate a calculus called QPi, for representing both the behavior and the trustworthiness property of concurrent systems. QPi is the combination of pi-calculus and a constraint semiring, which has a feature when problems with multi-dimensional properties must be tackled. The concept of the quantified bisimulation of processes provides us a measure of the degree of equivalence of processes based on the bisimulation distance. The QPi related properties of bisimulation and bisimilarity are also discussed. A specific modeling example is given to illustrate the effectiveness of the algebraic method.
ER -