Behavioral compatibility analysis for context-independent service substitution

Service composition and substitution are major research fields in Service Oriented Computing (SOC). Behavioral compatibility is very important. This paper proposes a context-dependent behavioral substitutability analysis approach. Web service processes are modeled by Petri nets. By analyzing the partial orders of transitions for the substituted service, several algorithms are given for temporal constraints generation. And this paper proves that if new services satisfy the temporal constraints, the new composite service must be sound and deadlock-free. To explain the algorithms clearly, a detailed example is shown. The results and algorithms can be used to improve the existing methods of service substitution verification.