Deadlock prevention for service orchestration via controlled Petri nets

被引:4
作者
Bi, Jing [1 ,3 ]
Yuan, Haitao [2 ,3 ]
Tan, Wei [4 ]
机构
[1] Beijing Univ Technol, Fac Informat Technol, Beijing, Peoples R China
[2] Beijing Jiaotong Univ, Sch Software Engn, Beijing, Peoples R China
[3] New Jersey Inst Technol, Dept Elect & Comp Engn, Newark, NJ 07102 USA
[4] IBM TJ Watson Res Ctr, Yorktown Hts, NY USA
基金
中国国家自然科学基金;
关键词
Service orchestration; Controlled Petri net; Compatibility enforcement; Deadlock prevention; DISCRETE-EVENT SYSTEMS; MANUFACTURING SYSTEMS; EXECUTION; REDUCTION; SIPHONS; DESIGN;
D O I
10.1016/j.jpdc.2018.09.010
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In multi-party Web service composition, the non-local choice mismatch is one of the most important problems. To solve it, the reachability graph-based method is widely adopted to check deadlock-freeness by generating adaptors. However, this method is inefficient due to the neglect of future deadlock states and requirements of many possible interactions. This work proposes an abnormity prevention strategy and an optimal controller for service collaboration. To overcome drawbacks of previous studies, this work describes service choreography by using service workflow nets. Moreover, this work formulates a novel reachability graph by combining structures and reachability analysis. To present abnormity, a maximally permissive state feedback control policy is then proposed. Furthermore, to avoid deadlocks in service orchestration, this work constructs an optimal controller for administrators of service composition. Finally, experiments demonstrate the advantage of the proposed method via a realistic example. (C) 2018 Elsevier Inc. All rights reserved.
引用
收藏
页码:92 / 105
页数:14
相关论文
共 55 条
[1]  
Ait-Bachir A, 2009, LECT NOTES COMPUT SC, V5690, P229
[2]  
[Anonymous], 2003 P 4 INT C WEB I
[3]   Big Data computing and clouds: Trends and future directions [J].
Assuncao, Marcos D. ;
Calheiros, Rodrigo N. ;
Bianchi, Silvia ;
Netto, Marco A. S. ;
Buyya, Rajkumar .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2015, 79-80 :3-15
[4]   Automated Synthesis of Service Choreographies [J].
Autili, Marco ;
Inverardi, Paola ;
Tivoli, Massimo .
IEEE SOFTWARE, 2015, 32 (01) :50-57
[5]  
Basu S, 2012, POPL 12: PROCEEDINGS OF THE 39TH ANNUAL ACM SIGPLAN-SIGACT SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES, P191
[6]   Automated Synthesis of Mediators to Support Component Interoperability [J].
Bennaceur, Amel ;
Issarny, Valerie .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 2015, 41 (03) :221-240
[7]  
Bertolino A, 2015, IEEE SOFTWARE, V32, P35, DOI 10.1109/MS.2015.16
[8]   Composition as a Service [J].
Blake, M. Brian ;
Tan, Wei ;
Rosenberg, Florian .
IEEE INTERNET COMPUTING, 2010, 14 (01) :78-82
[9]  
CARBONE M, 2007, P 16 EUR S PROGR ESO
[10]  
Coffman E. G. Jr., 1971, Computing Surveys, V3, P67, DOI 10.1145/356586.356588