Chinese Journal of Computers (计算机学报) 2013/36:12 PP.2479-2490
There are more and more composite Web services with complex interactions over the Internet, so how to efficiently and effectively verify their compatibility is important. However, there are two major challenges: compatibility verification should be faster, and the verification should include complete and precise incompatibility interactions. In order to address the two challenges, we propose a compatibility verification approach based on conflict interactions. This approach exploits the behavior constraint relation to verify compatibility. And we prove that this approach is able to reach the agreement with the compatibility defined in the classical research works. Finally, we evaluate our approach with the SAP reference repository, which is used by many research works. Experiments illustrate that our approach outperforms the state-of-the-art on time complexity, and is able to discover complete and precise incompatibility interactions.