Satisfaction and Coherence of Deadline Constraints in Inter-Organizational Workflows

The integration of time constraints in Inter-Organizational Workflows (IOWs) is an important issue in the workflow research field. Since each partner exposes a limited version of his business process, some information is kept hidden and not visible to all partners. The inter-enterprise business process, however, is obtained by joining all activities and control flows that have relevant roles within the context of the global operation. It should be noted that this composition process does not intrinsically guarantee the satisfaction of any critical deadline constraints that may be imposed by the partners. Obviously, expressing and satisfying time deadlines is important for modern business processes that need to be optimized for efficiency and extreme competitiveness. In this paper, we propose a temporal extension to CoopFlow, an existing approach for designing and modeling IOW, based on Time Petri Net models. A method for expressing and publishing sensible time deadlines, by the partners, is given. We also give a systematic method assuring the verification and the consistency of the published time constraints within the context of the global business process, while maintaining the core advantage of CoopFlow, that each partner can keep the critical part of his business process private.

[1]  Zahir Tari,et al.  On the Move to Meaningful Internet Systems 2005: CoopIS, DOA, and ODBASE, OTM Confederated International Conferences CoopIS, DOA, and ODBASE 2005, Agia Napa, Cyprus, October 31 - November 4, 2005, Proceedings, Part I , 2005, OTM Conferences.

[2]  Samir Tata,et al.  CoopFlow: A Framework for Inter-organizational Workflow Cooperation , 2005, OTM Conferences.

[3]  Wenfei Fan,et al.  Keys with Upward Wildcards for XML , 2001, DEXA.

[4]  Samir Tata,et al.  CoopFlow: A Bottom-Up Approach to Workflow Cooperation for Short-Term Virtual Enterprises , 2008, IEEE Transactions on Services Computing.

[5]  Philip Meir Merlin,et al.  A study of the recoverability of computing systems. , 1974 .

[6]  Wil M. P. van der Aalst,et al.  The Application of Petri Nets to Workflow Management , 1998, J. Circuits Syst. Comput..

[7]  Samir Tata,et al.  Symbolic Abstraction and Deadlock-Freeness Verification of Inter-enterprise Processes , 2009, BPM.

[8]  Johann Eder,et al.  Temporal Consistency of View Based Interorganizational Workflows , 2008, UNISCON.

[9]  Johann Eder,et al.  Temporal Modeling of Workflows with Conditional Execution Paths , 2000, DEXA.

[10]  Elena Navarro,et al.  Testing Time Goal-Driven Requirements with Model Checking Techniques , 2007, 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (ECBS'07).

[11]  Jean-Pierre Thomesse,et al.  Time constraint verification methods based on time Petri nets , 1997, Proceedings of the Sixth IEEE Computer Society Workshop on Future Trends of Distributed Computing Systems.

[12]  Samir Tata,et al.  The view-based approach to dynamic inter-organizational workflow cooperation , 2006, Data Knowl. Eng..

[13]  Samir Tata,et al.  Modeling Time Constraints in Inter-organizational Workflows , 2010, ICEIS.

[14]  Samir Tata,et al.  Workflow Abstraction for Privacy Preservation , 2007, WISE Workshops.

[15]  Karen Godary-Dejean LPT : Little Parametric Tool, outil pour la validation d'une borne temporelle paramétrée , 2008 .

[16]  Johann Eder,et al.  Temporal Conformance of Federated Choreographies , 2008, DEXA.

[17]  Raman Kazhamiakin,et al.  Representation, Verification, and Computation of Timed Properties in Web , 2006, 2006 IEEE International Conference on Web Services (ICWS'06).

[18]  Johann Eder,et al.  Managing Time in Workflow Systems , 2000 .