A Petri Net Approach to Analyzing Behavioral Compatibility and Similarity of Web Services
Web services have become the technology of choice for service-oriented computing implementation, where Web services can be composed in response to some users' needs. It is critical to verify the compatibility of component Web services to ensure the correctness of the whole composition in which these components participate. Traditionally, two conditions need to be satisfied during the verification of compatibility: reachable termination and proper termination. Unfortunately, it is complex and time consuming to verify those two conditions. To reduce the complexity of this verification, the authors model Web services using colored Petri Nets (PNs) so that a specific property of their structures is looked into, namely, well structuredness.