{"title":"On the Data Delivery Delay taken by Random Walks in Wireless Sensor Networks","authors":"I. Mabrouki, G. Froc, X. Lagrange","doi":"10.1109/QEST.2008.30","DOIUrl":"https://doi.org/10.1109/QEST.2008.30","url":null,"abstract":"In recent years, the use of random walk techniques in wireless sensor networks has attracted considerable interest among numerous research efforts. The popularity of this approach is attributed to the natural properties of random walks such as locality, simplicity, low-overhead and inherent robustness. However, throughout the variety of research works that assess the effectiveness of random walk techniques, most results are derived from a qualitative view or by means of simulations. Furthermore, when analytical tools are used, the obtained results often provide bounds on various performance metrics of interest, which may have little consequences for practical applications. Instead, our goal in this paper is to quantify the effectiveness of such techniques based on the derivation of closed-form expressions.In particular, we focus on the delay taken for the random walk to deliver messages from sensor to sink nodes and study its statistics through closed-form derivations.","PeriodicalId":161274,"journal":{"name":"2008 Fifth International Conference on Quantitative Evaluation of Systems","volume":"34 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":"133681841","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}
{"title":"Model Checking and Decision Procedures for Probabilistic Automata and Markov Chains","authors":"J. Worrell","doi":"10.1109/QEST.2008.54","DOIUrl":"https://doi.org/10.1109/QEST.2008.54","url":null,"abstract":"Finite-state probabilistic automata were introduced by Michael Rabin in the 1960s and have recently been the subject of renewed interest. In the first half of this tutorial we review classical results and open problems on the complexity of decision problems for probabilistic automata, including the analogs of language inclusion, language equivalence and language emptiness.","PeriodicalId":161274,"journal":{"name":"2008 Fifth International Conference on Quantitative Evaluation of Systems","volume":"1 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":"129894092","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}
{"title":"Linear Programming, Lyapunov Functions, and Performance Analysis","authors":"P. Glynn","doi":"10.1109/QEST.2008.50","DOIUrl":"https://doi.org/10.1109/QEST.2008.50","url":null,"abstract":"Many of the stochastic models that are used in the performance engineering context can be viewed as Markov processes, evolving in either discrete time or continuous time. In this talk, we will discuss the use of Lyapunov functions in computing steady-state performance bounds for such Markov processes. We will further discuss how such bounds can be used to develop linear programming-based algorithms that are capable of accurately computing system performance for infinite state models, in which the Markov state descriptor is either a discrete or continuous variable. We will illustrate these linear programming ideas by discussing their application to numerical computation of stationary distributions of reflected Brownian motion (RBM); such RBMs arise as \"heavy-traffic\" limits of conventional queuing networks. This work is joint with Denis Saure and Assaf Zeevi.","PeriodicalId":161274,"journal":{"name":"2008 Fifth International Conference on Quantitative Evaluation of Systems","volume":"36 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":"129621666","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}
{"title":"Prism2Promela","authors":"C. Power, Alice Miller","doi":"10.1109/QEST.2008.20","DOIUrl":"https://doi.org/10.1109/QEST.2008.20","url":null,"abstract":"The Prism model checker facilitates the formal modelling and analysis of systems that exhibit random or probabilistic behaviour. Prism lacks the provision of methods for specification debugging. To help alleviate this problem, we present a tool Prism2Promela for translating Prism into Promela. Once in this form, the SPIN model checker can be used to identify errors in the Promela specification, which can be traced back to corresponding errors in the original Prism specification.","PeriodicalId":161274,"journal":{"name":"2008 Fifth International Conference on Quantitative Evaluation of Systems","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122391730","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}