A Linear Logic Based Method for Deadlock-Freeness Scenarios Monitoring in Web Services Composition

This paper presents a method for the monitoring of deadlock-freeness scenarios in Web Services composition. This method considers the Petri net theory and is based on the analysis of Linear Logic proof trees with dates. In the proposed method, a Linear Logic proof tree with date is built for each different deadlock-freeness scenario in the composed system. These proof trees are analysed and the data obtained from them are used to guide the execution of such scenarios, avoiding the deadlock situations. The CPN Tools is used for the implementation and analysis of a monitored model to evaluate the efficacy of the proposed method.