Lígia Maria Soares Passos

Qualitative analysis of WorkFlow nets using linear logic: Soundness verification

This paper presents a method for the qualitative analysis of WorkFlow nets based on the proof trees of linear logic. The analysis is concerned with the proof of the correctness criterion soundness defined for WorkFlow nets. To prove the soundness property, a proof tree of linear logic is built for each different scenario of the WorkFlow net. Based on this approach, a method is proposed to verify in linear time if the WorkFlow net is sound.

Deadlock-Freeness Scenarios Detection in Web Service Composition

This paper presents a method for deadlock-freeness scenarios detection in Web services composition. This method considers the Petri nets theory and is based on the analysis of Linear Logic proof trees. To detect the deadlock-freeness scenarios, a Linear Logic proof tree is built for each different scenario of the modules from which the composed system is built. These proof trees are analysed and some candidates to be used in deadlock-freeness scenarios are identified. These candidates are proven by the construction and analysis of a Linear Logic proof tree that considers the local scenarios involved within it. Then, the deadlock-freeness scenarios can be analysed by the organization staff to decide if these scenarios can provide all their necessary business relationships.

Qualitative Analysis of Interorganizational WorkFlow Nets Using Linear Logic: Soundness Verification

This paper presents a method for qualitative analysis of Interorganizational WorkFlow nets based on the proof trees of Linear Logic. This analysis is concerned with the proof of the Soundness correctness criterion defined for Interorganizational WorkFlow nets. To prove the Soundness property, a proof tree of Linear Logic is built for each different scenario of the IOWF-net and for the Local WorkFlow nets from which it is composed. The proposed method permits one to verify Soundness without deciding boundedness that is EXPSPACE-hard and considers the very structure of the net. Furthermore, the proposed approach gives guidance for the adjustment of interorganizational workflow processes that do not satisfy Soundness.

Linear Logic as a Tool for Deadlock-Freeness Scenarios Detection in Interorganizational Workflow Processes

This paper presents a method for deadlock-freeness scenarios detection in interorganizational workflow processes. This method considers the Interorganizational WorkFlow nets theory and is based on the analysis of Linear Logic proof trees. To detect the deadlock-freeness scenarios, a Linear Logic proof tree is built for each different scenario of the Local WorkFlow nets from which the Interorganizational WorkFlow net is composed. These proof trees are analysed and some candidates to be used in deadlock-freeness scenarios are identified. These candidates are proven by the construction and analysis of a Linear Logic proof tree that considers the local scenarios involved within it. Then, the deadlock-freeness scenarios can be analysed by the organizations staff to decide if these scenarios can provide all their necessary business relationships.

Linear Logic as a Tool for Qualitative and Quantitative Analysis of Workow Processes

This article presents a method for qualitative and quantitative analysis of WorkFlow nets based on the proof trees of Linear Logic. The qualitative analysis is concerned with the proof of Soundness correctness criterion defined for WorkFlow nets. To prove the Soundness property, a proof tree of Linear Logic is built for each different scenario of the WorkFlow net. The quantitative analysis is concerned with the resource planning for each task of the workflow process and is based on the computation of symbolic date intervals for task execution. In particular, such symbolic date intervals are computed using the proof trees used to prove Soundness property.

Relaxed Soundness Verification for Interorganizational Workflow Processes

This paper presents a method for the Relaxed Soundness verification of interorganizational workflow processes. The method considers Interorganizational WorkFlow net models and is based on the analysis of Linear Logic proof trees. To verify the Relaxed Soundness criterion, a Linear Logic proof tree is built for each different scenario of an unfolded InterorganizationalWorkFlow net. These proof trees are then analysed considering two conditions: the first verifies if the analysed scenario can finish properly, without spare tokens and the second verifies if every activity concerning the global process was covered by at least one possible scenario. The Interorganizational WorkFlow net is then considered as relaxed sound if the scenarios satisfy these conditions.

Siphon-based deadlock prevention policy for interorganizational WorkFlow net design

In this paper, an approach based on Deadlock avoidance of Interorganizational WorkFlow nets is proposed to deal with Deadlock situations in interorganizational business processes. Interorganizational business processes are modeled by Interorganizational WorkFlow nets. Deadlock situations in interorganizational business processes comes generally from message ordering mismatches between several business processes. Within the Petri net theory, a Deadlock situation is characterized as a zero marking of a Siphon. After detecting and controlling the Siphon structures that lead to Deadlock situations in Interorganizational WorkFlow nets, a method for the design of Interorganizational WorkFlow nets free of Deadlock is proposed. In particular, the basic principle is to define new WorkFlow nets shared between the original workflow processes that allow one to remove the scenarios responsible for the Deadlocks.

A Synchronization Rule Based on Linear Logic for Deadlock Prevention in Interorganizational WorkFlow Nets

This paper presents an approach based on the analysis of Linear Logic proof trees and Interorganizational WorkFlow nets (IOWF-nets) theory to prevent deadlock situations in interorganizational workflow (IOWF) processes. An IOWF can be locally sound but not globally sound. Deadlock situations in IOWF processes come then from message ordering mismatches between several local workflow processes. Scenarios of IOWF-nets can be characterized by sequents of Linear Logic. The analysis of Linear Logic proof trees can be used to detect communication places between distinct WorkFlow nets (WF-nets) that introduce deadlock situations. In this paper, a synchronization rule is proposed in order to prevent deadlock situations caused by asynchronous communication mechanisms used to allow collaboration among individual workflow processes in IOWF processes that are locally sound but not necessarily globally sound.

A Linear Logic based Synchronization Rule for Deadlock Prevention in Web Service Composition.

This paper presents a prevention method for deadlock situations in Web Services composition. This method considers the Petri net theory and is based on the analysis of Linear Logic proof trees. Initially, it is necessary to detect deadlock scenarios by analyzing the Linear Logic proof trees built for each different scenario of the modules from which the composed system is built. Following on from this, a synchronization rule is proposed in order to prevent deadlock situations in these deadlock scenarios. The basic principle of such a rule is to force workflow modules to execute specific tasks respecting a local scheduling policy in order to remove the situations responsible for the deadlocks. This paper therefore presents a synchronization strategy to prevent deadlock situations in Web Services composition that are deadlock-free within the local workflow modules but not necessarily deadlock-free when considering the entire composed system.

Linear Logic as a Tool for Weak Soundness Verification for Interorganizational Workflow Processes

This paper presents a method for the Weak Soundness verification of interorganizational workflow processes. The proposed method considers the Interorganizational WorkFlow nets theory and is based on the analysis of Linear Logic proof trees. To verify the Weak Soundness criterion, a Linear Logic proof tree is built for each different scenario of an unfolded Interorganizational WorkFlow net. These proof trees are then analysed to verify if the analysed scenarios can finish properly. The Interorganizational WorkFlow net is then considered as weak sound if each scenario satisfies this condition, i.e., the analysed process is deadlock-free. A comparison with a classical approach based on reachability graph construction and analysis shows the advantages of using Linear Logic to verify the Weak Soundness criterion for interorganizational workflow processes.