Deadlock prevention for service orchestration via controlled Petri nets

Abstract

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.