Reachability analysis of service process model based on polychromatic sets

How to analyze the complex service processes is a key issue of service process management in rapidly changing environment. In this paper, a new approach to reachability analysis of service process model is proposed. The polychromatic sets (PS) theory is introduced and the PS model of service process is established. Based on PS contour matrix, the physical reachability and the time reachability are analyzed. Model simplification rules and algorithm are proposed to examine structure conflicts, and model decomposition algorithm is presented to verify physical reachability. Time consumption and deadline of activities are analyzed statically and dynamically. A case study of order service process is used to illustrate the effectiveness of the proposed approach.