Title: A sprouting graph-based approach to analysing timed workflow processes with shared resources

Authors: Yanhua Du; Ruyue Li; Benyuan Yang

Addresses: School of Mechanical Engineering, University of Science and Technology Beijing, Beijing 100083, China ' School of Mechanical Engineering, University of Science and Technology Beijing, Beijing 100083, China ' School of Mechanical Engineering, University of Science and Technology Beijing, Beijing 100083, China

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.

Keywords: timed workflow net; TWF-net; sprouting graph; shared resource; petri net; temporal constraint.

DOI: 10.1504/IJHPCN.2017.086530

International Journal of High Performance Computing and Networking, 2017 Vol.10 No.4/5, pp.259 - 268

Received: 30 Sep 2015
Accepted: 04 Nov 2015
Published online: 12 Sep 2017 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article