基于有限状态自动机的Web服务组合

摘要

Web services are special software resources located in the web which is discovered and invoked by agents. How to composite web services to fulfill a specified user requirement (goal service) reminds a problems to be solved in the research. Using finite state machine (FSM), the states and operations of web services community are modeled with the states and actions of the FSM, and the external and internal schemas for the operations of web service are described. In combining with the deterministic propositional dynamic logic, the composable problem of the goal service is determined. And ifthe goal service can be composed by the existing web services,the composition plan can be made. The complexity of this the algorithm is also explored.%Web服务是Web上的特殊软件资源,可以被应用系统发现和调用.如何根据用户的需求(目标服务)来组合Web服务是研究中需要解决的重要问题.通过使用有限状态自动机,服务组成的社区中的状态和操作可以使用有限状态自动机来模拟,这样可以表示服务操作的内部和外部概要.结合确定性动态命题逻辑,可以根据已有的Web服务,解决目标服务的可组合问题,产生组合计划.同时讨论了算法的复杂性.