Timed Modeling and Verification of BPEL Processes Using Time Petri Nets

The execution time, an important criterion to measure the quality of a BPEL process, can be influenced by some slow external partner services (i.e., some long-running services). Therefore, it is desirable to specify response time of services into the SLAs (service level agreements). In this way, service consumers could verify whether the candidate services satisfy the expected time requirements before they are invoked. However, existing solutions are time-consuming especially when the BPEL process is quite complex (e.g., involving parallel structures and loops) and the number of candidate services is huge. To address this problem, in this paper, we propose a time Petri nets-based verification approach that efficiently verifies time requirements for a BPEL process. This allows service consumers to quickly identify suitable partner services that satisfy the time requirements at service looking up stage.