In order to fully realize semantic interoperability among distributed and heterogeneous applications on the web, a set of effective interoperability mechanisms is presented. This mechanism adopts service interactive i...In order to fully realize semantic interoperability among distributed and heterogeneous applications on the web, a set of effective interoperability mechanisms is presented. This mechanism adopts service interactive interfaces （SII） and service aggregative interfaces （SAI） modeled with abstract state machine （ASM） to abstractly describe the behavior of the invoked web service instances, which makes business processing accurately specify tasks and effectively solves the problems of communication and collaboration between service providers and service requesters. The mechanism also uses appropriate mediators to solve the problems of information and coinmunication incompatibility during the course of service interaction, which is convenient for service interoperability, sharing and integration. The mechanism＇ s working principle and interoperability implementation are illustrated by a use case in detail.展开更多
In order to improve the design and implementation quality of web service compositions,formal methods are used to model them and certain properties are verified.WCFA （web service interface control flow automata）is us...In order to improve the design and implementation quality of web service compositions,formal methods are used to model them and certain properties are verified.WCFA （web service interface control flow automata）is used to model web services,especially the control flow and possible interactions with other web services.A web service composition consists of a set of interacting WCFA.The global behavior of web service compositions is captured by NWA（nested word automata）.A variation of the depth-first search algorithm is used to transform a set of WCFA into an NWA.State formulae and call stacks at each node of NWA are computed by a path-sensitive reachability analysis.Safety properties,call stack inspection properties and pre/post-conditions of service invocations are described by assertions.Then verification of these assertions is carried out by an automated SAT tool.展开更多
基金The Natural Science Foundation of Hunan Province (No.05JJ30122),the Education Department Foundation of Hunan Prov-ince (No.05C519).
文摘In order to fully realize semantic interoperability among distributed and heterogeneous applications on the web, a set of effective interoperability mechanisms is presented. This mechanism adopts service interactive interfaces （SII） and service aggregative interfaces （SAI） modeled with abstract state machine （ASM） to abstractly describe the behavior of the invoked web service instances, which makes business processing accurately specify tasks and effectively solves the problems of communication and collaboration between service providers and service requesters. The mechanism also uses appropriate mediators to solve the problems of information and coinmunication incompatibility during the course of service interaction, which is convenient for service interoperability, sharing and integration. The mechanism＇ s working principle and interoperability implementation are illustrated by a use case in detail.
基金The National Key Technology R&D Program of Chinaduring the 11th Five-Year Plan Period(No.2006BAH02A12)the National High Technology Research and Development Program of China(863 Program)(No.2006AA010101)
文摘In order to improve the design and implementation quality of web service compositions,formal methods are used to model them and certain properties are verified.WCFA （web service interface control flow automata）is used to model web services,especially the control flow and possible interactions with other web services.A web service composition consists of a set of interacting WCFA.The global behavior of web service compositions is captured by NWA（nested word automata）.A variation of the depth-first search algorithm is used to transform a set of WCFA into an NWA.State formulae and call stacks at each node of NWA are computed by a path-sensitive reachability analysis.Safety properties,call stack inspection properties and pre/post-conditions of service invocations are described by assertions.Then verification of these assertions is carried out by an automated SAT tool.
