{"title":"Mean Field for Performance Models with Deterministically-Timed Transitions","authors":"R. A. Hayden","doi":"10.1109/QEST.2012.27","DOIUrl":"https://doi.org/10.1109/QEST.2012.27","url":null,"abstract":"We extend the mean-field (a.k.a. fluid-analysis) approach for massively-parallel continuous-time Markov chains (CTMCs) to models with both Markovian and deterministically-timed transitions. We introduce a new low-level formalism for specifying massively-parallel models with generally-timed transitions, the population generalised semi-Markov process (PGSMP). We then show how systems of coupled delay differential equations (DDEs) which approximate transient component counts may be mechanistically derived from such models. This is possible not only in the case of non-competing deterministic delays, but also where the deterministic transitions may race locally with simultaneously enabled Markovian ones. For a large class of PGSMP models, we are able to prove mean-field convergence formally and to construct a second-order limit process. In the steady state, we show that it is not always straightforward to apply the fixed point approach to approximate the stationary behaviour of a PGSMP. To address this, we provide a new algorithm for computing steady-state mean-field approximations for PGSMP models leveraging the theory of Markov regenerative processes. Throughout, our techniques are illustrated on a number of simple worked examples drawn from the areas of peer-to-peer networks and wireless sensor networks.","PeriodicalId":327231,"journal":{"name":"2012 Ninth International Conference on Quantitative Evaluation of Systems","volume":"195 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116221664","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":"A General Reliability Model for Data Storage Systems","authors":"V. Venkatesan, I. Iliadis","doi":"10.1109/QEST.2012.32","DOIUrl":"https://doi.org/10.1109/QEST.2012.32","url":null,"abstract":"Typical models for analysis of storage system reliability assume independent and exponentially distributed times to failure. Also the rebuild time periods are often assumed to be deterministic or to follow an exponential distribution, or alternatively a Weibull distribution. As a first step towards a generalization of these models, we consider more general non-exponential distributions for failure and rebuild times while still retaining the independence assumption. It is shown that the mean time to data loss (MTTDL) of storage systems is practically insensitive to the actual failure distribution when the storage nodes are generally reliable, that is, when their mean time to failure is much larger than their mean time to repair. This implies that MTTDL results previously obtained in the literature by assuming exponential node failure distributions may still be valid despite this unrealistic assumption. In contrast, it is shown that the MTTDL depends on the characteristics of the rebuild distribution.","PeriodicalId":327231,"journal":{"name":"2012 Ninth International Conference on Quantitative Evaluation of Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123927378","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":"Operational Versus Weakest Precondition Semantics for the Probabilistic Guarded Command Language","authors":"Friedrich Gretz, J. Katoen, Annabelle McIver","doi":"10.1109/QEST.2012.21","DOIUrl":"https://doi.org/10.1109/QEST.2012.21","url":null,"abstract":"This paper proposes a simple operational semanticsof pGCL, Dijkstra's guarded command language extended withprobabilistic choice, and relates this to pGCL's wp-semantics byMcIver and Morgan. Parameterised Markov decision processeswhose state rewards depend on the post-expectation at handare used as operational model. We show that the weakest pre-expectationof a pGCL-program w.r.t. a post-expectation correspondsto the expected cumulative reward to reach a terminalstate in the parameterised MDP associated to the program. In asimilar way, we show a correspondence between weakest liberalpre-expectations and liberal expected cumulative rewards.","PeriodicalId":327231,"journal":{"name":"2012 Ninth International Conference on Quantitative Evaluation of Systems","volume":"613 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124070479","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":"A Multi-layer Fluid Queue with Boundary Phase Transitions and Its Application to the Analysis of Multi-type Queues with General Customer Impatience","authors":"G. Horváth, B. V. Houdt","doi":"10.1109/QEST.2012.12","DOIUrl":"https://doi.org/10.1109/QEST.2012.12","url":null,"abstract":"Consider a Markov modulated fluid queue with multiple layers separated by a finite number of boundaries, where each layer is characterized by its own set of matrices. In the past, matrix analytic methods have been devised to determine the stationary behavior of such a fluid queue for no-resistance, sticky and repellent boundaries. In this paper we extend this approach by allowing general phase transitions at the boundaries. As an application, we analyze the MMAP[K]/PH[K]/1 queue with general, customer type dependent impatience, where customers remain impatient while being served. We show that the steady state distribution of the age process of this queue can be expressed via the steady state distribution of a multi-layered fluid queue with phase transitions at the boundary. Based on the analysis of the age process, expressions for the sojourn time distribution and for the probability of abandonment are presented.","PeriodicalId":327231,"journal":{"name":"2012 Ninth International Conference on Quantitative Evaluation of Systems","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130236031","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}
M. Bugliesi, L. Gallina, A. Marin, S. Rossi, Sardaouna Hamadou
{"title":"Interference-Sensitive Preorders for MANETs","authors":"M. Bugliesi, L. Gallina, A. Marin, S. Rossi, Sardaouna Hamadou","doi":"10.1109/QEST.2012.15","DOIUrl":"https://doi.org/10.1109/QEST.2012.15","url":null,"abstract":"Connectivity and communication interference are two key aspects in mobile ad-hoc networks (MANETs). We propose a process algebraic model targeted at the analysis of both such aspects of MANETs. The framework includes a probabilistic process calculus and a suite of analytical techniques based on a probabilistic observational congruence and an interference-sensitive preorder. The observational congruence allows us to verify whether two networks exhibit the same behaviour. The preorder makes it possible to evaluate the interference level of different, behaviourally equivalent, networks. We show our framework at work on the analysis of the well-known Alternating Bit Protocol, contrasting the behavior of the standard implementation of the protocol against an alternative implementation that exploits an ideal interference cancellation scheme for CDMA transmissions.","PeriodicalId":327231,"journal":{"name":"2012 Ninth International Conference on Quantitative Evaluation of Systems","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122228004","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":"Finite Queues at the Limit of Saturation","authors":"M. Telek, M. Vécsei","doi":"10.1109/QEST.2012.20","DOIUrl":"https://doi.org/10.1109/QEST.2012.20","url":null,"abstract":"A wide range of real life systems are modeled by queueing systems with finite capacity buffers. There are well established numerical procedures for the analysis of these queueing models when the load islower or higher than the system capacity, but these numerical methods become unstable as the loadgets close to the system capacity. We present simple modifications of the standard computational methodswhich remain numerically stable at saturation as well. We consider two specific Markov models: finite quasi birth death (QBD) processand finite Markov fluid queue (MFQ). The first one describes the behavior of queueing systems with discretebuffer content, while the second one describes the behavior of queueing systems with continuous buffer content. The stationary solution of a finite QBD process is a combination of two matrix geometric serieswhile the stationary fluid density of a finite MFQ is a combination of two matrix exponential functions. Apart of this there are several further similarities between the discrete and continuous buffer modelsat saturation. The proposed solution method exploits the similarities of the models.","PeriodicalId":327231,"journal":{"name":"2012 Ninth International Conference on Quantitative Evaluation of Systems","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122321442","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":"Verification of Two-Variable Logic Revisited","authors":"Michael Benedikt, R. Lenhardt, J. Worrell","doi":"10.1109/QEST.2012.38","DOIUrl":"https://doi.org/10.1109/QEST.2012.38","url":null,"abstract":"Two-variable logic is a fragment of first-order logic that allows for decidable verification problems. In previous work, we developed an approach to FO2 verification that is particularly useful for probabilistic systems, based on analysis of the translation of FO2 to automata. In this work we show that the techniques introduced there can be applied to give information on other logics, and can be used in conjunction with automata-theoretic techniques for Linear Temporal Logic (LTL) in the context of probabilistic verification. First we revisit the technique of our prior work starting with FO2 without the successor relation. Making use of recent results by Weis we show here that we can get quite small automata for these formula. We then show that we can recapture the automata size bounds for general FO2 formulas by bootstrapping results for FO2 without successor. Next, we look at combining FO2 verification techniques with those for LTL. We present here a language that subsumes both FO2 and LTL, and inherits the model checking properties of both languages. Our automata translation gives new bounds on model-checking for this large language for non-deterministic systems, and is particularly useful for probabilistic systems: e.g Markov Chains, Recursive Markov Chains, and Markov Decision Processes.","PeriodicalId":327231,"journal":{"name":"2012 Ninth International Conference on Quantitative Evaluation of Systems","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134059589","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":"Aggregation of Markovian Models -- An Alternating Least Squares Approach","authors":"P. Buchholz, J. Kriege","doi":"10.1109/QEST.2012.17","DOIUrl":"https://doi.org/10.1109/QEST.2012.17","url":null,"abstract":"To deal with the problem of state space explosion in Markovian models often compositional modeling and the aggregation of components are used. Several approximate aggregation methods exist which are usually based on heuristics. This paper presents a new aggregation approach for Markovian components which computes aggregates that minimize the difference according to some algebraically defined function which describes the difference between the component and the aggregate. If the difference becomes zero, aggregation is exact and component and aggregate are indistinguishable. Approximate aggregates are computed using an alternating least squares approach which tries to minimize the norm-wise difference between the original component and the aggregate. The approach is extended to generate bounding aggregates which allow one to compute bounds on transient or stationary quantities when the aggregate is embedded in an environment.","PeriodicalId":327231,"journal":{"name":"2012 Ninth International Conference on Quantitative Evaluation of Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129227263","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}
Matej Kohut, Anton Stefanek, R. A. Hayden, J. Bradley
{"title":"Specification and Efficient Computation of Passage-Time Distributions in GPA","authors":"Matej Kohut, Anton Stefanek, R. A. Hayden, J. Bradley","doi":"10.1109/QEST.2012.24","DOIUrl":"https://doi.org/10.1109/QEST.2012.24","url":null,"abstract":"We present a significant extension to the Grouped PEPA Analyser (GPA) tool. We have augmented the tool with the ability to specify complex passage-time distributions with the Unified Stochastic Probes formalism and implemented efficient fluid analysis techniques to compute the distributions. The extension incorporates immediate signalling and weighted passive rates and permits two classes of passage time, namely global and individual passage times, to be computed. We summarise how the different classes of passage-time query can be expressed using the Unified Stochastic Probe formalism and present some results from probed GPA models.","PeriodicalId":327231,"journal":{"name":"2012 Ninth International Conference on Quantitative Evaluation of Systems","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114600470","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}
Álvaro Fernández Díaz, C. Baier, Clara Benac Earle, Lars-Åke Fredlund
{"title":"Static Partial Order Reduction for Probabilistic Concurrent Systems","authors":"Álvaro Fernández Díaz, C. Baier, Clara Benac Earle, Lars-Åke Fredlund","doi":"10.1109/QEST.2012.22","DOIUrl":"https://doi.org/10.1109/QEST.2012.22","url":null,"abstract":"Sound criteria for partial order reduction for probabilistic concurrent systems have been presented in the literature. Their realization relies on a depth-first search-based approach for generating the reduced model. The drawback of this dynamic approach is that it can hardly be combined with other techniques to tackle the state explosion problem, e.g., symbolic probabilistic model checking with multi-terminal variants of binary decision diagrams. Following the approach presented by Kurshan et al. for non-probabilistic systems, we study partial order reduction techniques for probabilistic concurrent systems that can be realized by a static analysis. The idea is to inject the reduction criteria into the control flow graphs of the processes of the system to be analyzed. We provide the theoretical foundations of static partial order reduction for probabilistic concurrent systems and present algorithms to realize them. Finally, we report on some experimental results.","PeriodicalId":327231,"journal":{"name":"2012 Ninth International Conference on Quantitative Evaluation of Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129386696","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}