2008 Fifth International Conference on Quantitative Evaluation of Systems最新文献

CaVi -- Simulation and Model Checking for Wireless Sensor Networks 无线传感器网络的仿真与模型检验

2008 Fifth International Conference on Quantitative Evaluation of Systems Pub Date : 2008-09-14 DOI: 10.1109/QEST.2008.32

A. Boulis, A. Fehnker, Matthias Fruth, Annabelle McIver

引用次数: 16

Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems 拟生-死过程，树状qbd，概率1-计数器自动机和下推系统

2008 Fifth International Conference on Quantitative Evaluation of Systems Pub Date : 2008-09-14 DOI: 10.1109/QEST.2008.35

K. Etessami, D. Wojtczak, M. Yannakakis

{"title":"Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems","authors":"K. Etessami, D. Wojtczak, M. Yannakakis","doi":"10.1109/QEST.2008.35","DOIUrl":"https://doi.org/10.1109/QEST.2008.35","url":null,"abstract":"We begin by observing that (discrete-time) Quasi-Birth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and both Tree-Like QBDs (TL-QBDs) and Tree-Structured QBDs (TS-QBDs) are equivalent to both probabilistic Pushdown Systems (pPDSs) and Recursive Markov Chains (RMCs). We then proceed to exploit these connections to obtain a number of new algorithmic upper and lower bounds for central computational problems about these models. Our main result is this: for an arbitrary QBD (even a null-recurrent one), we can approximate its termination probabilities (i.e., its G matrix) to within i bits of precision (i.e., within additive error 1/2i), in time polynomial in both the encoding size of the QBD and in i, in the unit-cost rational arithmetic RAM model of computation. Specifically, we show that a decomposed Newton's method can be used to achieve this. We emphasize that this bound is very different from the well-known \"linear/quadratic convergence\" of numerical analysis, known for QBDs and TL-QBDs, which typically gives no constructive bound in terms of the encoding size of the system being solved. In fact, we observe (based on recent results for pPDSs) that for the more general TL-QBDs this bound fails badly. Specifically, in the worst case Newton's method \"converges linearly\" to the termination probabilities for TL-QBDs, but requires exponentially many iterations in the encoding size of the TL-QBD to approximate these probabilities within any non-trivial constant error c < 1. Our upper bound proof for QBDs combines several ingredients: a detailed analysis of the structure of 1-counter automata, an iterative application of a classic condition number bound for errors in linear systems,and a very recent constructive bound on the performance of Newton's method for monotone systems of polynomial equations.","PeriodicalId":161274,"journal":{"name":"2008 Fifth International Conference on Quantitative Evaluation of Systems","volume":"321 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120887476","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}

引用次数: 54

Reduction Techniques for Model Checking Markov Decision Processes 模型检验马尔可夫决策过程的约简技术

2008 Fifth International Conference on Quantitative Evaluation of Systems Pub Date : 2008-09-14 DOI: 10.1109/QEST.2008.45

Frank Ciesinski, C. Baier, Marcus Größer, Joachim Klein

引用次数: 43

A Control-Theoretic Modeling Approach for Service Differentiation in Multi-hop Ad-hoc Networks 多跳Ad-hoc网络中业务分化的控制理论建模方法

2008 Fifth International Conference on Quantitative Evaluation of Systems Pub Date : 2008-09-14 DOI: 10.1109/QEST.2008.17

Yimeng Yang, B. Haverkort, G. Heijenk

引用次数: 3

Product Form Approximations for Communicating Markov Processes 通信马尔可夫过程的乘积形式近似

2008 Fifth International Conference on Quantitative Evaluation of Systems Pub Date : 2008-09-14 DOI: 10.1109/QEST.2008.23

P. Buchholz

引用次数: 25

A Parallel and Distributed Analysis Pipeline for Performance Tree Evaluation 性能树评估的并行分布式分析管道

2008 Fifth International Conference on Quantitative Evaluation of Systems Pub Date : 2008-09-14 DOI: 10.1109/QEST.2008.22

Darren K. Brien, N. Dingle, W. Knottenbelt, H. Kulatunga, T. Suto

引用次数: 1

Memory Efficient Calculation of Path Probabilities in Large Structured Markov Chains 大型结构马尔可夫链中路径概率的记忆高效计算

2008 Fifth International Conference on Quantitative Evaluation of Systems Pub Date : 2008-09-14 DOI: 10.1109/QEST.2008.25

Paolo Ballarini, A. Horváth

{"title":"Memory Efficient Calculation of Path Probabilities in Large Structured Markov Chains","authors":"Paolo Ballarini, A. Horváth","doi":"10.1109/QEST.2008.25","DOIUrl":"https://doi.org/10.1109/QEST.2008.25","url":null,"abstract":"The problem we deal with is the analysis of a class of large structured Markov chains. In particular we assume that the whole state space can be partitioned into disjoint sets (called macro states) in which the process corresponds to the parallel execution of independent jobs. Petri nets and process algebras with phase type (PH) distributed execution times give rise to this kind of model. These models are subject to the phenomenon of state space explosion. It is known that the infinitesimal generator of such models can be handled in a memory efficient way by storing only the \"structure '' of the infinitesimal generator as Kronecker expressions or decision diagrams. Less is known instead on how to perform the analysis of the model in a memory efficient manner because in case of most of the available methods the vector of transient or steady state probabilities are stored in an explicit manner. In this paper we consider the calculation of measures connected to the probability that the process passes through a given series of macro states.We show that such measures can be calculated in a memory efficient manner by Laplace transform techniques. The method is illustrated by numerical examples.","PeriodicalId":161274,"journal":{"name":"2008 Fifth International Conference on Quantitative Evaluation of Systems","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121870825","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}

引用次数: 2

Correctness Verification and Quantitative Evaluation of Timed Systems Based on Stochastic State Classes 基于随机状态类的定时系统正确性验证与定量评价

2008 Fifth International Conference on Quantitative Evaluation of Systems Pub Date : 2008-09-14 DOI: 10.1109/QEST.2008.53

E. Vicario

引用次数: 0

ProbDiVinE-MC: Multi-core LTL Model Checker for Probabilistic Systems 概率系统的多核LTL模型检查器ProbDiVinE-MC

2008 Fifth International Conference on Quantitative Evaluation of Systems Pub Date : 2008-09-14 DOI: 10.1109/QEST.2008.29

J. Barnat, L. Brim, I. Cerná, Milan Ceska, Jana Tumova

引用次数: 23

Analysis of an M/G/1 Queue with Repeated Inhomogeneous Vacations with Application to IEEE 802.16e Power Saving Mechanism 具有重复非均匀休假的M/G/1队列分析及其在IEEE 802.16e节能机制中的应用

2008 Fifth International Conference on Quantitative Evaluation of Systems Pub Date : 2008-09-14 DOI: 10.1109/QEST.2008.37

Sara Alouf, E. Altman, A. Azad

{"title":"Analysis of an M/G/1 Queue with Repeated Inhomogeneous Vacations with Application to IEEE 802.16e Power Saving Mechanism","authors":"Sara Alouf, E. Altman, A. Azad","doi":"10.1109/QEST.2008.37","DOIUrl":"https://doi.org/10.1109/QEST.2008.37","url":null,"abstract":"The goal of this paper is to establish a general approach for analyzing queueing models with repeated in homogeneous vacations. At the end of a vacation, the server goes on another vacation, possibly with a different probability distribution, if during the previous vacation there have been no arrivals. In case there have been one or more arrivals during a vacation then a busy period starts after a warm-up time. In order to get an insight on the influence of parameters on the performance, we choose to study a simple M/G/1 queue (Poisson arrivals and general independent service times) which has the advantage of being tractable analytically. The theoretical model is applied to the problem of power saving for mobile devices in which the sleep durations of a device correspond to the vacations of the server. Various system performance metrics such as the frame response time and the economy of energy are derived. A constrained optimization problem is formulated to maximize the economy of energy achieved in power save mode, with constraints as QoS conditions to be met. An illustration of the proposed methods is shown with a WiMAX system scenario to obtain design parameters for better performance. Our analysis allows us not only to optimize the system parameters for a given traffic intensity but also to propose parameters that provide the best performance under worst case conditions.","PeriodicalId":161274,"journal":{"name":"2008 Fifth International Conference on Quantitative Evaluation of Systems","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114604763","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}

引用次数: 31