algorithms for checking channel passing in web service choreography

ISCAS OpenIR

	algorithms for checking channel passing in web service choreography
	Yang Hongli; Cai Chao; Peng Liyang; Zhao Xiangpeng; Qiu Zongyan; Qin Shengchao
	2013
Source	Frontiers of Computer Science
ISSN	2095-2228
Pages	1-19
English Abstract	Web service choreography describes global models of service interactions among a set of participants. For an interaction to be executed, the participants must know the required channel(s) used in the interaction, otherwise the execution will get stuck. Since channels are composed dynamically, the initial channel set of each participant is often insufficient to meet the requirements. It is the responsibility of the participants to pass required channels owned (known) by one to others. Since service choreography may involve many participants and complex channel constraints, it is hard for designers to specify channel passing in a choreography exactly as required. We address the problem of checking whether a service choreography lacks channels or has redundant channels, and how to automatically generate channel passing based on interaction flows of the service choreography in the case of channel absence. Concretely, we propose a simple language Chorc, a channel interaction sub-language for modeling the channel passing aspect of service choreography. Based on the formal operational semantics of Chorc, the algorithms for static checking of service choreography and generating channel passing are also studied, and the complexity results of algorithms are discussed. Moreover, some illustrated service choreography examples are presented to show how to formalize and analyze service choreography with channel passing in Chorc. © 2013 Higher Education Press and Springer-Verlag Berlin Heidelberg.; Web service choreography describes global models of service interactions among a set of participants. For an interaction to be executed, the participants must know the required channel(s) used in the interaction, otherwise the execution will get stuck. Since channels are composed dynamically, the initial channel set of each participant is often insufficient to meet the requirements. It is the responsibility of the participants to pass required channels owned (known) by one to others. Since service choreography may involve many participants and complex channel constraints, it is hard for designers to specify channel passing in a choreography exactly as required. We address the problem of checking whether a service choreography lacks channels or has redundant channels, and how to automatically generate channel passing based on interaction flows of the service choreography in the case of channel absence. Concretely, we propose a simple language Chorc, a channel interaction sub-language for modeling the channel passing aspect of service choreography. Based on the formal operational semantics of Chorc, the algorithms for static checking of service choreography and generating channel passing are also studied, and the complexity results of algorithms are discussed. Moreover, some illustrated service choreography examples are presented to show how to formalize and analyze service choreography with channel passing in Chorc. © 2013 Higher Education Press and Springer-Verlag Berlin Heidelberg.
Indexed Type	EI
Keyword	Algorithms Web Services Websites
Department	(1) College of Computer Sciences Beijing University of Technology Beijing 100222 China; (2) Institute of Software Chinese Academy of Sciences Beijing 100080 China; (3) China Defense Science and Technology Information Center Beijing 100142 China; (4) Vancl Research Lab Beijing 100124 China; (5) Facebook Inc. California 94025 United States; (6) LMAM and Department of Informatics School of Mathematical Sciences Peking University Beijing 100871 China; (7) School of Computing University of Teesside Middlesbrough TS1 3BA United Kingdom
Language	英语
WOS ID	WOS:000325129700008
Citation statistics
Content Type	期刊论文
URI	http://ir.iscas.ac.cn/handle/311060/15648
Collection	中国科学院软件研究所
Recommended Citation GB/T 7714	Yang Hongli,Cai Chao,Peng Liyang,et al. algorithms for checking channel passing in web service choreography[J]. Frontiers of Computer Science,2013:1-19.
APA	Yang Hongli,Cai Chao,Peng Liyang,Zhao Xiangpeng,Qiu Zongyan,&Qin Shengchao.(2013).algorithms for checking channel passing in web service choreography.Frontiers of Computer Science,1-19.
MLA	Yang Hongli,et al."algorithms for checking channel passing in web service choreography".Frontiers of Computer Science (2013):1-19.

Files in This Item:
There are no files associated with this item.

If you have any objections to this item, please fill out the form below and the administrator will contact you as soon as possible.
Content:
Email：	*
Institution:
Verification Code:	Refresh

Any comments and suggestions are welcomed.
Title:	*
Content:
Email：	*
Verification Code:	Refresh

中国科学院软件研究所机构知识库