2009 Sixth International Conference on the Quantitative Evaluation of Systems最新文献

{"title":"FlowSim Simulation Benchmarking Platform","authors":"Jonathan Bogdoll, H. Hermanns, Lijun Zhang","doi":"10.1109/QEST.2009.20","DOIUrl":"https://doi.org/10.1109/QEST.2009.20","url":null,"abstract":"Probabilistic model checking has emerged as a versatile system verification approach, but is frequently facing state-space explosion problems. One promising attack to this is to construct an abstract model which simulates the original model, and to perform model checking on that abstract model. Recently, efficient algorithms and optimizations for deciding simulation of probabilistic models have been proposed, which reduces the theoretical complexity bounds of existing algorithm drastically. In this paper we present a tool to compare the performance of these approaches for deciding the simulation preorder of probabilistic models.","PeriodicalId":187276,"journal":{"name":"2009 Sixth International Conference on the Quantitative Evaluation of Systems","volume":"16 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132880924","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":"Faster Maximum Likelihood Estimation Algorithms for Markovian Arrival Processes","authors":"H. Okamura, T. Dohi","doi":"10.1109/QEST.2009.28","DOIUrl":"https://doi.org/10.1109/QEST.2009.28","url":null,"abstract":"This paper proposes two improvements of fitting algorithms for Markovian arrival processes (MAPs). The first improvement is to enhance the computation speed of Ryd'en's EM algorithm (1996) for estimating MAP parameters. The second one is to provide an efficient sub-class of MAPs to be appropriate for fitting to real traffic data. More precisely, we propose a traffic modeling based on a hidden Markov model which belongs to a sub-class of MAPs. Such a modeling framework leads to a faster fitting algorithm than the conventional algorithm with general MAPs. In numerical examples, we present the effectiveness of proposed fitting algorithms through a real traffic trace.","PeriodicalId":187276,"journal":{"name":"2009 Sixth International Conference on the Quantitative Evaluation of Systems","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123673129","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":"An Introduction to Monte Carlo Methods and Rare Event Simulation","authors":"G. Rubino, B. Tuffin","doi":"10.1109/QEST.2009.13","DOIUrl":"https://doi.org/10.1109/QEST.2009.13","url":null,"abstract":"The goal of this tutorial is to discuss how rare event analysis can be tackled through Monte Carlo simulation.","PeriodicalId":187276,"journal":{"name":"2009 Sixth International Conference on the Quantitative Evaluation of Systems","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123768327","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":"Design Space Exploration for Java Processors with Cross-Profiling","authors":"Martin Schoeberl, Walter Binder, Philippe Moret, A. Villazón","doi":"10.1109/QEST.2009.15","DOIUrl":"https://doi.org/10.1109/QEST.2009.15","url":null,"abstract":"Most processors are used in embedded systems, where the processorarchitectures are diverse due to optimizations for differentapplication domains. The main challenge for embedded systemprocessors is the right balance between performance and chip size,which directly relates to cost. An early estimation of theperformance for a new design is of paramount importance. In thispaper we propose cross-profiling for that performance estimation,which can be accomplished very early in the design phase. We evaluateour approach in the context of a Java processor for embedded systemsusing cross-profiling on a standard desktop Java virtual machine. Weexplore the performance impact of various processor design choicesand optimizations, such as different caches strategies or pipelineorganizations, and come up with an improved processor design thatyields speedups of up to 40% on standard Java benchmarks. Comparingthe generated cross-profiles with the execution of benchmarks in realhardware confirms that our approach is sound.","PeriodicalId":187276,"journal":{"name":"2009 Sixth International Conference on the Quantitative Evaluation of Systems","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116320954","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":"Demultiplexing in Network Calculus- A Stochastic Scaling Approach","authors":"J. Schmitt, I. Martinovic","doi":"10.1109/QEST.2009.19","DOIUrl":"https://doi.org/10.1109/QEST.2009.19","url":null,"abstract":"During the last two decades, starting with the seminal work by Cruz, network calculus has evolved as a new theory for the performance analysis of networked systems. In contrast to classical queueing theory, it deals with performance bounds instead of average values and thus has been the theoretical basis of quality of service proposals such as the IETF’s Integrated and Differentiated Services architectures. Besides these it has, however, recently seen many other applications scenarios as, for example, wireless sensor networks, switched Ethernets, avionic networks, Systems-on-Chip, or even to speed-up simulations, to name a few.In this paper, we extend network calculus by a new versatile modelling element: a demultiplexer. Conventionally, demultiplexing has either been neglected or assumed to be static, i.e., be fixed at the setup time of a network. This is restrictive for many potential applications of network calculus. For example a load balancing based on current link loads in a network could not be modelled with conventional network calculus means. Our demultiplexing element is based on stochastic scaling. Fundamental results on a network calculus with stochastic scaling are therefore derived in this work. We illustrate the benefits of the demultiplexer in the sample application of load balancing.","PeriodicalId":187276,"journal":{"name":"2009 Sixth International Conference on the Quantitative Evaluation of Systems","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117029312","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":"PerDaCol and PerfAnalysis - A Tool Set for Performance Measurement Data Collection and Evaluation of Real-Time Communication Systems","authors":"Antonius Erdmann, D. Weber","doi":"10.1109/QEST.2009.46","DOIUrl":"https://doi.org/10.1109/QEST.2009.46","url":null,"abstract":"This contribution describes a tool set which has been implemented over the last years within Nokia Siemens Net-works (NSN) in order to help analyzing and optimizing various product lines of many of today’s NSN large-scale telecommuni-cation systems platforms which are based on Unix-like soft-ware architecture. The paper and the tool presentation gives an overview of the general implementation concepts of the tool and outlines the advantages of the tool set by means of various examples from a practical point of view.","PeriodicalId":187276,"journal":{"name":"2009 Sixth International Conference on the Quantitative Evaluation of Systems","volume":"16 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120963513","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":"Safety Analysis of an Airbag System Using Probabilistic FMEA and Probabilistic Counterexamples","authors":"Husain Aljazzar, M. Fischer, L. Grunske, M. Kuntz, Florian Leitner-Fischer, S. Leue","doi":"10.1109/QEST.2009.8","DOIUrl":"https://doi.org/10.1109/QEST.2009.8","url":null,"abstract":"Failure mode and effects analysis (FMEA) isa technique to reason about possible system hazards thatresult from system or system component failures. Traditionally, FMEA does not take the probabilities with which these failures may occur into account. Recently, this shortcoming was addressed by integrating stochastic model checking techniques into the FMEA process. A further improvement is the integration of techniques for the generation of counterexamples for stochastic models, which we propose in this paper. Counterexamples facilitate the redesign of a potentially unsafe system by providing information which components contribute most to the failure of the entire system. The usefulness of this novel approach to the FMEA process is illustrated by applying it to the case study of an airbag system provided by our industrial partner, the TRW Automotive GmbH.","PeriodicalId":187276,"journal":{"name":"2009 Sixth International Conference on the Quantitative Evaluation of Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131128251","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":"Nondeterministic Labeled Markov Processes: Bisimulations and Logical Characterization","authors":"P. D’Argenio, N. Wolovick, Pedro Sánchez Terraf, P. Celayes","doi":"10.1109/QEST.2009.17","DOIUrl":"https://doi.org/10.1109/QEST.2009.17","url":null,"abstract":"We extend the theory of labeled Markov processeswith internal nondeterminism, a fundamental conceptfor the further development of a process theory withabstraction on nondeterministic continuous probabilisticsystems. We define nondeterministic labeled Markovprocesses (NLMP) and provide both a state basedbisimulation and an event based bisimulation. We showthe relation between them, including that the largeststate bisimulation is also an event bisimulation. Wealso introduce a variation of the Hennessy-Milnerlogic that characterizes event bisimulation and that issound w.r.t. the state base bisimulation for arbitraryNLMP. This logic, however, is infinitary as it containsa denumerable ∨. We then introduce a finitary sublogicthat characterize both state and event bisimulation forimage finite NLMP whose underlying measure spaceis also analytic. Hence, in this setting, all notions ofbisimulation we deal with turn out to be equal.","PeriodicalId":187276,"journal":{"name":"2009 Sixth International Conference on the Quantitative Evaluation of Systems","volume":"254 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128282487","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 Heuristic Approach for Fitting MAPs to Moments and Joint Moments","authors":"P. Buchholz, J. Kriege","doi":"10.1109/QEST.2009.36","DOIUrl":"https://doi.org/10.1109/QEST.2009.36","url":null,"abstract":"Fitting of the parameters of a Phase Type (PH) Distribution or a Markovian Arrival Process (MAP) according to some quantities of measured data streams is still a challenge. This paper presents a new approach which computes in two steps for a set of moments and joint moments for an Acyclic PH distribution that is expanded into a MAP. In contrast to other known approaches, parameters are computed to minimize the weighted squared difference between the measured moments and the moments of the resulting PH Distribution or MAP. The proposed approach is very flexible and allows one to generate a MAP of a predefined order to approximate a given set of moments and joint moments. It is shown that the approximation is often sufficiently accurate even with MAPs of a moderate size. However, we also show that the practical applicability of the approach is limited since the exact determination of higher order moments from traces requires an extremely high effort.","PeriodicalId":187276,"journal":{"name":"2009 Sixth International Conference on the Quantitative Evaluation of Systems","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115058057","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":"Analyzing Large Sparse Markov Chains of Kronecker Products","authors":"T. Dayar","doi":"10.1109/QEST.2009.12","DOIUrl":"https://doi.org/10.1109/QEST.2009.12","url":null,"abstract":"Kronecker products are used to define the underlying Markov chain (MC)in various modeling formalisms, including compositional Markovian models,hierarchical Markovian models, and stochastic process algebras. The motivation behind using a Kronecker structured representation rather than a flat one is to alleviate the storage requirements associated with the MC. With this approach, systems that are an order of magnitude larger can be analyzed on the same platform. In the Kronecker based approach, the generator matrix underlying the MC is represented using Kronecker products cite{D81} of smaller matrices and is never explicitly generated. The implementation of transient and steady--state solvers rests on this compact Kronecker representation, thanks to the existence of an efficient vector--Kronecker product multiplication algorithm known as the {em shuffle} algorithm cite{D81}. The transient distribution can be computed through uniformization using vector--Kronecker product multiplications. The steady--state distribution also needs to be computed using vector--Kronecker product multiplications, since direct methods basedon complete factorizations, such as Gaussian elimination, normally introduce new nonzeros which cannot be accommodated. The two papers cite{B99c,SAP95} provide good overviews of iterative solution techniques for the analysis of MCs based on Kronecker products. Issues related to reachability analysis, vector--Kronecker product multiplication, hierarchical state space generation in Kronecker based matrix representations for large Markov models are surveyed in cite{BK04}. Throughout our discussion, we make the assumption that the MC at hand does not have unreachable states, meaning it is irreducible. And we take an algebraic view cite{D06} to discuss recent results related to the analysis of MCs based on Kronecker products independently from modeling formalisms. We provide background material on the Kronecker representation of the generator matrix underlying a CTMC, show that it has a rich structure which is nested and recursive, and introduce a small CTMC whose generator matrix is expressed as a sum of Kronecker products; this CTMC is used as a running example throughout the discussion. We also consider preprocessing of the Kronecker representation so as to expedite numerical analysis. We discuss permuting the nonzero structure of the underlying CTMC symmetrically by reordering, changing the orders of the nested blocks by grouping, and reducing the size of the state space by lumping. The steady--state analysis of CTMCs based on Kronecker products is discussed for block iterative methods, multilevel methods, and preconditioned projection methods, respectively. The results can be extended to DTMCs based on Kronecker products with minor modifications.Areas that need further research are mentioned as they are discussed. Our contribution to this area over the years corresponds to work along iterative methods based on splittings and their bloc","PeriodicalId":187276,"journal":{"name":"2009 Sixth International Conference on the Quantitative Evaluation of Systems","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116000643","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}