Deciding Substitutability of Web Services with Petri Net Reduction Techniques

Service substitutability is one of the most notable research challenges in service-oriented-computing. In this paper, we define the context independent substitutability of web services based on Petri net reduction techniques. The interface information and the inner behavior features of web services are modeled by labeled open net. The definition of bisimulation equivalence between two labeled open nets is presented firstly. Two web services can substitute each other which are modeled by labeled open nets when they are bisimulation equivalence. Presents reduction rules suited for labeled open nets and prove the labeled open nets before and after the reduction are bisimulation equivalence. The reduction methods can reduce the complexity of deciding substitutability of web services.