论文部分内容阅读
Web服务是Web上的特殊软件资源,可以被应用系统发现和调用。如何根据用户的需求(目标服务)来组合Web服务是研究中需要解决的重要问题。通过使用有限状态自动机,服务组成的社区中的状态和操作可以使用有限状态自动机来模拟,这样可以表示服务操作的内部和外部概要。结合确定性动态命题逻辑,可以根据已有的Web服务,解决目标服务的可组合问题,产生组合计划。同时讨论了算法的复杂性。
Web services are special software resources on the Web that can be discovered and called by application systems. How to combine Web services according to the needs of users (target services) is an important issue to be solved in the research. By using finite state automatons, states and operations in a community of services can be modeled using finite state automata, which can represent internal and external summaries of service operations. Combined with deterministic dynamic propositional logic, we can solve the combinable problem of target service according to the existing Web service and generate the combined plan. The complexity of the algorithm is also discussed.