Infinity最新文献_第5页

Model Checking Probabilistic Real-Time Properties for Service-Oriented Systems with Service Level Agreements 具有服务水平协议的面向服务系统的概率实时属性的模型检查

Infinity Pub Date : 2011-11-13 DOI: 10.4204/EPTCS.73.8

Christian Krause, H. Giese

{"title":"Model Checking Probabilistic Real-Time Properties for Service-Oriented Systems with Service Level Agreements","authors":"Christian Krause, H. Giese","doi":"10.4204/EPTCS.73.8","DOIUrl":"https://doi.org/10.4204/EPTCS.73.8","url":null,"abstract":"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.","PeriodicalId":31175,"journal":{"name":"Infinity","volume":"19 1","pages":"64-78"},"PeriodicalIF":0.0,"publicationDate":"2011-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74715261","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 7

Synthesis of Switching Rules for Ensuring Reachability Properties of Sampled Linear Systems 保证采样线性系统可达性的切换规则的综合

Infinity Pub Date : 2011-11-13 DOI: 10.4204/EPTCS.73.6

L. Fribourg, B. Revol, R. Soulat

引用次数: 2

A coinductive semantics of the Unlimited Register Machine 无限寄存器机的协归纳语义

Infinity Pub Date : 2011-11-11 DOI: 10.4204/EPTCS.73.7

Alberto Ciaffaglione

引用次数: 5

Practical Distributed Control Synthesis 实用分布式控制综合

Infinity Pub Date : 2011-11-01 DOI: 10.4204/EPTCS.73.2

D. Peled, S. Schewe

引用次数: 5

Implicit Real Vector Automata 隐式实向量自动机

Infinity Pub Date : 2010-10-31 DOI: 10.4204/EPTCS.39.5

Bernard Boigelot, Julien Brusten, Jean-François Degbomont

引用次数: 5

Probabilistic regular graphs 概率正则图

Infinity Pub Date : 2010-10-28 DOI: 10.4204/EPTCS.39.6

N. Bertrand, Christophe Morvan

引用次数: 4

IMITATOR II: A Tool for Solving the Good Parameters Problem in Timed Automata 模仿者II:求解时间自动机中好参数问题的工具

Infinity Pub Date : 2010-10-28 DOI: 10.4204/EPTCS.39.7

É. André

引用次数: 26

On Zone-Based Analysis of Duration Probabilistic Automata 基于区域的持续概率自动机分析

Infinity Pub Date : 2010-10-01 DOI: 10.4204/EPTCS.39.3

O. Maler, K. Larsen, B. Krogh

引用次数: 28

On interleaving in {P,A}-Time Petri nets with strong semantics 强语义的{P,A}时间Petri网的交错

Infinity Pub Date : 2010-10-01 DOI: 10.4204/EPTCS.39.2

H. Boucheneb, Kamel Barkaoui

引用次数: 2

DiVinE: Parallel Distributed Model Checker DiVinE:并行分布式模型检查器

Infinity Pub Date : 2010-09-30 DOI: 10.1109/PDMC-HIBI.2010.9

J. Barnat, L. Brim, Milan Ceska, Petr Ročkai

{"title":"DiVinE: Parallel Distributed Model Checker","authors":"J. Barnat, L. Brim, Milan Ceska, Petr Ročkai","doi":"10.1109/PDMC-HIBI.2010.9","DOIUrl":"https://doi.org/10.1109/PDMC-HIBI.2010.9","url":null,"abstract":"Model checking became a standard method of analyzing complex systems in many application domains. No doubt, a number of applications is placing great demands on model checking tools. The process of analysis of complex and real-life systems often requires vast computation resources, memory in particular. This phenomenon, referred to as the state space explosion problem, has been tackled by many researchers during the past two decades. A plethora of more or less successful techniques to fight the problem have been introduced, including parallel and distributed-memory processing. DiVinE is a tool for LTL model checking and reach ability analysis of discrete distributed systems. The tool is able to efficiently exploit the aggregate computing power of multiple network-interconnected multi-cored workstations in order to deal with extremely large verification tasks. As such it allows to analyze systems whose size is far beyond the size of systems that can be handled with regular sequential tools. While the main focus of the tool is on high-performance explicit state model checking, an emphasis is also put on ease of deployment and usage. Additionally, the component architecture and publicly available source code of Divine allow for its usage as a platform for research on parallel and distributed-memory model checking techniques.","PeriodicalId":31175,"journal":{"name":"Infinity","volume":"54 1","pages":"4-7"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90775560","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 77