BPEL应用恢复计划的优化计算
Optimizing Computation of Recovery Plans for BPEL Applications
摘要:
Web服务应用程序是由动态绑定的服务组成的分布式进程。在我们以前的工作中[15],我们描述了一个框架,用于根据行为正确性属性(使用属性模式描述并转换为有限状态自动机)执行Web服务的运行时监控。这些指定禁止的行为(安全属性)和期望的行为(有界活性属性)。在运行时,将检查在XML中描述的Web服务的有限执行跟踪的一致性。当违规行为被发现时,我们的框架会自动提出并排名恢复计划,然后用户可以选择执行。这种安全违规的计划基本上涉及“返回”-补偿执行的操作,直到应用程序的替代行为成为可能。对于有界活性违规,恢复计划包括“返回”和“重新规划”-引导应用程序实现所需的行为。在[16]中报告的我们的经验确定了这种方法的缺点:我们计算了太多的计划,这是由于(a)过度近似可能存在替代行为的程序点的数量,以及(b)为可能违反安全属性的有界活性属性生成恢复计划。在本文中,我们描述了改进我们的框架,解决这些问题,并描述其有效性的案例研究。
英文摘要:
Web service applications are distributed processes that are composed of dynamically bounded services. In our previous work [15], we have described a framework for performing runtime monitoring of web service against behavioural correctness properties (described using property patterns and converted into finite state automata). These specify forbidden behavior (safety properties) and desired behavior (bounded liveness properties). Finite execution traces of web services described in BPEL are checked for conformance at runtime. When violations are discovered, our framework automatically proposes and ranks recovery plans which users can then select for execution. Such plans for safety violations essentially involve "going back" - compensating the executed actions until an alternative behaviour of the application is possible. For bounded liveness violations, recovery plans include both "going back" and "re-planning" - guiding the application towards a desired behaviour. Our experience, reported in [16], identified a drawback in this approach: we compute too many plans due to (a) overapproximating the number of program points where an alternative behaviour is possible and (b) generating recovery plans for bounded liveness properties which can potentially violate safety properties. In this paper, we describe improvements to our framework that remedy these problems and describe their effectiveness on a case study.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。