A New Approach to Modeling and Analyzing Timed Compatibility of Service Composition under Temporal Constraints

In enterprises, timed compatibility (i.e., temporal constraint satisfiability) have become an important factor to guarantee the timely completion of service composition so that meet the requirements of customers and ensure the success execution of enterprises. However, existing researches do not fully investigate the mixture situations where distributions of service durations are complex and diverse, and consider both the uncertainty of queue time and operation time of services. In this paper, we propose a new approach to modeling and analyzing timed compatibility of service composition where time durations are mixture distributed. First, we calculate the duration of activities in service with considering both the queue time and operation time. Second, we obtain the time information of interactive activities in service. Finally, we get the time information of paths in services and check the temporal constraints. Furthermore, a real-life case is used to illustrate the efficiency and effectiveness of our approach.