2011 Eighth International Conference on Quantitative Evaluation of SysTems最新文献_第3页

Adaptive Gridding for Abstraction and Verification of Stochastic Hybrid Systems 随机混合系统的自适应网格提取与验证

2011 Eighth International Conference on Quantitative Evaluation of SysTems Pub Date : 2011-09-05 DOI: 10.1109/QEST.2011.16

S. Soudjani, A. Abate

引用次数: 45

Controlling Modelling Artifacts 控制建模工件

2011 Eighth International Conference on Quantitative Evaluation of SysTems Pub Date : 2011-09-05 DOI: 10.1109/QEST.2011.32

Michael J. A. Smith, F. Nielson, H. R. Nielson

{"title":"Controlling Modelling Artifacts","authors":"Michael J. A. Smith, F. Nielson, H. R. Nielson","doi":"10.1109/QEST.2011.32","DOIUrl":"https://doi.org/10.1109/QEST.2011.32","url":null,"abstract":"When analysing the performance of a complex system, we typically build abstract models that are small enough to analyse, but still capture the relevant details of the system. But it is difficult to know whether the model accurately describes the real system, or if its behaviour is due to modelling artifacts that were inadvertently introduced. In this paper, we propose a novel methodology to reason about modelling artifacts, given a detailed model and a high-level (more abstract) model of the same system. By a series of automated abstraction steps, we lift the detailed model to the same state space as the high-level model, so that they can be directly compared. There are two key ideas in our approach -- a temporal abstraction, where we only look at the state of the system at certain observable points in time, and a spatial abstraction, where we project onto a smaller state space that summarises the possible configurations of the system (for example, by counting the number of components in a certain state). We motivate our methodology with a case study of the LMAC protocol for wireless sensor networks. In particular, we investigate the accuracy of a recently proposed high-level model of LMAC, and identify some modelling artifacts in the model. Since we can apply our abstractions on-the-fly, while exploring the state space of the detailed model, we can analyse larger networks than are possible with existing techniques.","PeriodicalId":252235,"journal":{"name":"2011 Eighth International Conference on Quantitative Evaluation of SysTems","volume":"232 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122835046","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}

引用次数: 0

Probabilistic Model Checking of Non-Markovian Models with Concurrent Generally Distributed Timers 具有并发一般分布计时器的非马尔可夫模型的概率模型检验

2011 Eighth International Conference on Quantitative Evaluation of SysTems Pub Date : 2011-09-05 DOI: 10.1109/QEST.2011.23

A. Horváth, Marco Paolieri, L. Ridi, E. Vicario

{"title":"Probabilistic Model Checking of Non-Markovian Models with Concurrent Generally Distributed Timers","authors":"A. Horváth, Marco Paolieri, L. Ridi, E. Vicario","doi":"10.1109/QEST.2011.23","DOIUrl":"https://doi.org/10.1109/QEST.2011.23","url":null,"abstract":"In the analysis of stochastic concurrent timed models, probabilistic model checking combines qualitative identification of feasible behaviors with quantitative evaluation of their probability. If the stochastic process underlying the model is a Continuous Time Markov Chain (CTMC), the problem can be solved by leveraging on the memoryless property of exponential distributions. However, when multiple generally distributed timers can be concurrently enabled, the underlying process may become a Generalized Semi Markov Process (GSMP) for which simulation is often advocated as the only viable approach to evaluation. The method of stochastic state classes provides a means for the analysis of models belonging to this class, that relies on the derivation of multivariate joint distributions of times to fire supported over Difference Bounds Matrix (DBM) zones. Transient stochastic state classes extend the approach with an additional age clock associating each state with the distribution of the time at which it can be reached. We show how transient stochastic state classes can be used to perform bounded probabilistic model checking also for models with underlying GSMPs, and we characterize the conditions for termination of the resulting algorithm, both in exact and approximate evaluation. We also show how the number of classes enumerated to complete the analysis can be largely reduced through a look-ahead in the non-deterministic state class graph of reachable DBM zones. As notable traits, the proposed technique accepts efficient implementation based on DBM zones without requiring the split of domains in regions, and it expresses the bound in terms of a bilateral constraint on the elapsed time without requiring assumptions on the discrete number of executed transitions. Experimental results based on a preliminary implementation in the Oris tool are reported.","PeriodicalId":252235,"journal":{"name":"2011 Eighth International Conference on Quantitative Evaluation of SysTems","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127051962","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}

引用次数: 4

Hybrid Limits of Continuous Time Markov Chains 连续时间马尔可夫链的混合极限

2011 Eighth International Conference on Quantitative Evaluation of SysTems Pub Date : 2011-09-05 DOI: 10.1109/QEST.2011.10

L. Bortolussi

引用次数: 25

Compositional Abstractions for Long-Run Properties of Stochastic Systems 随机系统长期特性的组合抽象

2011 Eighth International Conference on Quantitative Evaluation of SysTems Pub Date : 2011-09-05 DOI: 10.1109/QEST.2011.37

Michael J. A. Smith

{"title":"Compositional Abstractions for Long-Run Properties of Stochastic Systems","authors":"Michael J. A. Smith","doi":"10.1109/QEST.2011.37","DOIUrl":"https://doi.org/10.1109/QEST.2011.37","url":null,"abstract":"When analysing the performance of a system, we are often interested in long-run properties, such as the proportion of time it spends in a certain state. Stochastic process algebras help us to answer this sort of question by building a compositional model of the system, and using tools to analyse its underlying Markov chain. However, compositionality in the model leads to a state space explosion in the Markov chain, which severely limits the size of models we can analyse. Because of this, we look for abstraction techniques that allow us to analyse a smaller model that safely bounds the properties of the original. In this paper, we present an approach to bounding long-run properties of models in the stochastic process algebra PEPA. We use a method called stochastic bounds to build upper and lower bounds of the underlying Markov chain that are lump able, and therefore can be reduced in size. Importantly, we do this compositionally, so that we bound each component of the model separately, and compose these to obtain a bound for the entire model. We present an algorithm for this, based on extending the algorithm by Fourneau et al to deal with partially-ordered state spaces. Finally, we present some results from our implementation, which forms part of the PEPA plug-in for Eclipse. We compare the precision and state space reduction with results obtained by computing long-run averages on a CTMDP-based abstraction.","PeriodicalId":252235,"journal":{"name":"2011 Eighth International Conference on Quantitative Evaluation of SysTems","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114355963","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

MARCIE - Model Checking and Reachability Analysis Done EffiCIEntly MARCIE -有效地完成模型检查和可达性分析

2011 Eighth International Conference on Quantitative Evaluation of SysTems Pub Date : 2011-09-05 DOI: 10.1007/978-3-642-38697-8_21

M. Heiner, Christian Rohr, M. Schwarick

引用次数: 114

Temperature-aware Real-Time Scheduling - Extended Abstract 温度感知实时调度-扩展摘要

2011 Eighth International Conference on Quantitative Evaluation of SysTems Pub Date : 2011-09-05 DOI: 10.1109/QEST.2011.13

L. Thiele

引用次数: 0

Fluid Limits Applied to Peer to Peer Network Analysis 应用于点对点网络分析的流体限制

2011 Eighth International Conference on Quantitative Evaluation of SysTems Pub Date : 2011-09-05 DOI: 10.1109/QEST.2011.11

L. Aspirot, E. Mordecki, G. Rubino

引用次数: 10

Game-based Abstraction and Controller Synthesis for Probabilistic Hybrid Systems 基于博弈的概率混合系统抽象与控制器综合

2011 Eighth International Conference on Quantitative Evaluation of SysTems Pub Date : 2011-09-01 DOI: 10.1109/QEST.2011.17

E. M. Hahn, G. Norman, D. Parker, Björn Wachter, Lijun Zhang

引用次数: 34

Partial Order Reduction for Model Checking Markov Decision Processes under Unconditional Fairness 无条件公平性下模型检验马尔可夫决策过程的偏阶约简

2011 Eighth International Conference on Quantitative Evaluation of SysTems Pub Date : 2011-09-01 DOI: 10.1109/QEST.2011.35

Henri Hansen, M. Kwiatkowska, Hongyang Qu

引用次数: 15