A Formal Model to Enforce Trustworthiness Requirements in Service Composition

Ning FU  Yingfeng ZHANG  Lijun SHAN  Zhiqiang LIU  Han PENG  

IEICE TRANSACTIONS on Information and Systems   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
trustworthy software,  process algebra,  pi-calculus,  Q-algebra,  semi-ring,  

Full Text: PDF>>
Buy this Article

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.