Abstract
Recently, temporal constraint satisfiability is regarded as an important criterion in the field of business process management. Existing methods do not fully investigate the various modes of shared resources, cannot provide the solutions for temporal violations or cannot develop the prototype system to automatically verify them. In this paper, we propose a new sprouting graph based approach to analysing temporal constraints of workflow processes with shared resources. First of all, in order to deal with various modes of shared resources we propose the corresponding patterns to record the executing information of resources. Then, how to automatically construct sprouting graph is presented, and the procedure of solving temporal violations is proposed. Finally, we also develop a prototype system. Compared with existing works, our approach is more effective and practical in the real business environment.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of High Performance Computing and Networking
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
