arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1111.3110cs.SEcs.LOcs.PF
收藏

基于服务级协议的面向服务系统概率实时的性模型检验

Model Checking Probabilistic Real-Time Properties for Service-Oriented Systems with Service Level Agreements

Christian Krause, Holger Giese

摘要:

服务质量属性的保证是面向服务的软件工程的一个重要方面。所谓的服务级别协议(SLA)的表示法,例如Web服务级别协议(WSLA)语言,提供了正式的语法来指定服务提供商和客户之间的(具有法律约束力的)合同方面的此类保证。另一方面,用于验证概率实时的【形】行为的形式化方法已经达到了一定的表达能力和效率水平,可以将其应用于现实世界的场景中。本文建议采用最近引入的区间概率时间自动机(IPTA)模型来对面向服务系统的QoS属性进行形式化验证。具体来说,我们表明,IPTA与概率时间自动机(PTA)相比,能够直接捕获SLA中指定的保证。IPTA分析中的一个特殊挑战是,它们的朴素语义通常会产生无限的状态集和无限分支的转换。然而,使用符号表示,IPTA可以进行分析,而有效。我们已经开发了第一个实现的IPTA模型检查器扩展的PRISM工具,并表明,模型检验IPTA是只稍微贵于模型检验可比PTA。

英文摘要:

The assurance of quality of service properties is an important aspect of service-oriented software engineering. Notations for so-called service level agreements (SLAs), such as the Web Service Level Agreement (WSLA) language, provide a formal syntax to specify such assurances in terms of (legally binding) contracts between a service provider and a customer. On the other hand, formal methods for verification of probabilistic real-time behavior have reached a level of expressiveness and efficiency which allows to apply them in real-world scenarios. In this paper, we suggest to employ the recently introduced model of Interval Probabilistic Timed Automata (IPTA) for formal verification of QoS properties of service-oriented systems. Specifically, we show that IPTA in contrast to Probabilistic Timed Automata (PTA) are able to capture the guarantees specified in SLAs directly. A particular challenge in the analysis of IPTA is the fact that their naive semantics usually yields an infinite set of states and infinitely-branching transitions. However, using symbolic representations, IPTA can be analyzed rather efficiently. We have developed the first implementation of an IPTA model checker by extending the PRISM tool and show that model checking IPTA is only slightly more expensive than model checking comparable PTA.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑