{"title":"Integrating TPNs and Performance Bound Techniques in ITPN-PerfBound: A New Import Functionality","authors":"Elina Pacini Naumovich, Simona Bernardi","doi":"10.1109/QEST.2009.39","DOIUrl":"https://doi.org/10.1109/QEST.2009.39","url":null,"abstract":"ITPN-PerfBound is a graphical tool for the modeling and performance bound analysis of Interval Time Petri Nets (ITPN), that has been developed within the DrawNET modeling framework. The tool supports the computation of metric bounds such as system throughput and task completion time. It provides also exporting facilities toward GreatSPN and TINA tools. In this paper, we present the old and the newly added functionalities of ITPN-PerfBound.","PeriodicalId":187276,"journal":{"name":"2009 Sixth International Conference on the Quantitative Evaluation of Systems","volume":" 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120833213","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":"Reachable State Space Generation for Structured Models which Use Functional Transitions","authors":"Afonso Sales, B. Plateau","doi":"10.1109/QEST.2009.29","DOIUrl":"https://doi.org/10.1109/QEST.2009.29","url":null,"abstract":"This paper presents a new approach to obtain the Reachable State Space (RSS) of a structured model which uses functional transitions. We use Multi-valued Decision Diagrams (MDD) to store sets of reachable spaces and Stochastic Automata Networks (SAN) formalism to describe structured models. We focus our contribution in the proposal of a method to generate a compact MDD description taking advantage of the modular structure of SAN formalism, which also allows to represent the transition rate matrix of a continuous-time Markov chain by means of a sum of generalized Kronecker products. The method is tested on some models and the conclusion presents future work.","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":"123406415","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":"Quantitative Model Checking of Systems with Degradation","authors":"J. Barnat, I. Cerná, Jana Tumova","doi":"10.1109/QEST.2009.24","DOIUrl":"https://doi.org/10.1109/QEST.2009.24","url":null,"abstract":"In this paper we describe a rather specialized quality of a system -- the degradation. We demonstrate systems that naturally incorporate degradation phenomenon and we show how these systems can be verified by adapting the standard automata-based approach to LTL model checking. We introduce B\"uchi Automata with Degradation Constraints (BADCs) to specify the desired properties of systems with degradation and we describe how these can be used for verification. A major obstacle in the verification process is that the synchronous product of the system and the B\"uchi automaton may be infinite, which we deal with by introducing a normal form of the B\"uchi automata and normalizing procedure. We also show that the newly introduced formalism can be used to distinguish MDPs indistinguishable by any LTL, PCTL or even PCTL* formula.","PeriodicalId":187276,"journal":{"name":"2009 Sixth International Conference on the Quantitative Evaluation of Systems","volume":"33 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":"115807852","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":"Simulation-Based CTMC Model Checking: An Empirical Evaluation","authors":"J. Katoen, I. Zapreev","doi":"10.1109/QEST.2009.25","DOIUrl":"https://doi.org/10.1109/QEST.2009.25","url":null,"abstract":"This paper provides an experimental study of the efficiency of simulation-based model-checking algorithms for continuous-time Markov chains by comparing:MRMC -- the only tool that implements (new) confidence-interval-based algorithms for verification of all main CSL formulae; Ymer -- that allows for verification oftime-bounded and time-interval until using sequential acceptance sampling; and VESTA -- that can verify time-bounded and unbounded until by means of simple hypothesis testing. The study shows that MRMC provides the most accurate verification results. Ymer and VESTA, unlike MRMC, have almost constant memory consumption. Ymer requiresthe least number of observations to assess the model-checking problem, but MRMC is mostly the fastest. This indicates that the tools' efficiency does not so muchdepend on sampling but is rather determined by extra computations.","PeriodicalId":187276,"journal":{"name":"2009 Sixth International Conference on the Quantitative Evaluation of Systems","volume":"63 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":"114098510","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":"TimerMeter: Quantifying Properties of Software Timers for System Analysis","authors":"M. Kuperberg, M. Krogmann, Ralf H. Reussner","doi":"10.1109/QEST.2009.49","DOIUrl":"https://doi.org/10.1109/QEST.2009.49","url":null,"abstract":"To analyse runtime behaviour and performance of software systems, accurate time measurements are obtained using timer methods. The underlying hardware timers and counters are read and processed by several software layers, which introduce overhead and delays that impact accuracy and statistical validity of fine-granular measurements. To understand and to control these impacts, the resulting accuracy of timer methods and their invocation costs must be quantified. However, quantitative properties of timer methods are usually not specified as they are platform-specific due to differences in hardware, operating systems and virtual machines. Also, no algorithm exists for precisely quantifying the timer methods’ properties, so programmers have to work with coarse estimates and cannot evaluate and compare different timer methods and timer APIs. In this paper, we present TimerMeter, a novel algorithm for platform-independent quantification of accuracy and invocation cost of any timer methods, without inspecting their implementation. We evaluate our approach on timer methods provided by the Java platform API, and compare them to additional timer methods that access hardware and software timers from Java. The presented algorithm and the evaluation results benefit researchers and programmers by forming a basis for selecting appropriate timers.","PeriodicalId":187276,"journal":{"name":"2009 Sixth International Conference on the Quantitative Evaluation of Systems","volume":"30 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":"121756282","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":"Generation of Counterexamples for Model Checking of Markov Decision Processes","authors":"Husain Aljazzar, S. Leue","doi":"10.1109/QEST.2009.10","DOIUrl":"https://doi.org/10.1109/QEST.2009.10","url":null,"abstract":"The practical usefulness of a model checker as a debugging tool relies on its ability to provide diagnostic information, sometimes also referred to as a counterexample. Current stochastic model checkers do not provide such diagnostic information. In this paper we address this problem for Markov Decision Processes. First, we define the notion of counterexamples in this context. Then, we discuss three methods to generate informative counterexamples which are helpful in system debugging. We point out the advantages and drawbacks of each method. We also experimentally compare all three methods. Our experiments demonstrate the conditions under which each method is appropriate to be used.","PeriodicalId":187276,"journal":{"name":"2009 Sixth International Conference on the Quantitative Evaluation of Systems","volume":"89 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":"126509915","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":"Petri Net Analysis Using Decision Diagrams","authors":"G. Ciardo","doi":"10.1109/QEST.2009.14","DOIUrl":"https://doi.org/10.1109/QEST.2009.14","url":null,"abstract":"This tutorial provides an introduction to the most important classes of decision diagrams and their applications in the area of verification and stochastic or timed modeling. In particular, we show how structured representations can greatly reduce the memory and time required for state-space generation, CTL model checking, numerical solution of Markov chains, and reachability analysis of nondeterministic integer-timed models. We use Petri nets (PNs) as the high-level model specification language, but the algorithms and data-structures presented are widely applicable to many other formalisms commonly used to describe discrete-state systems.","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":"126352747","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":"Language-Level Symmetry Reduction for Probabilistic Model Checking","authors":"A. Donaldson, Alice Miller, D. Parker","doi":"10.1109/QEST.2009.21","DOIUrl":"https://doi.org/10.1109/QEST.2009.21","url":null,"abstract":"Symmetry reduction is a technique for combatingstate-space explosion in model checking. The generic representatives approach to symmetry reduction uses a language-level translation of symmetric models to a reduced form, making it straightforward to combine with existing tools and implementations. These techniques have been proposed for both non-probabilistic and probabilistic model checking, but are currently difficult to apply to complex models due to prohibitive restrictions in the modelling language. We present a much richer language, which allows specification of probabilistic systems in a way that guarantees the applicability of the generic representatives technique, together with an extended translation algorithm, and demonstrate the effectiveness of our techniques on a large set of case studies.","PeriodicalId":187276,"journal":{"name":"2009 Sixth International Conference on the Quantitative Evaluation of Systems","volume":"208 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":"134328115","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":"On the Detection of Symmetries in Compositional Markov Models","authors":"Ruth Lamprecht, P. Kemper","doi":"10.1109/QEST.2009.47","DOIUrl":"https://doi.org/10.1109/QEST.2009.47","url":null,"abstract":"A model-based evaluation of a system’s design often considers to what degree components need to be available multiple times in order to reach a desired level of availability, reliability or dependability. Multiple components of the same kind then lead to models with regular structures and symmetries. In stochastic models, especially Markovian models, such regularities have been used to establish lumpability results. In this paper, we propose a procedure to detect symmetries in a Markovian model that is built in a compositional manner by sharing state variables. The symmetries give insight into a model and help to achieve a significant state space reduction, which alleviates the effects of the infamous state space explosion problem. The results extend existing work of Obal, McQuinn, and Sanders; in particular, we focus on variables in functional transition rates that commute in order to take additional symmetries into account. The overall approach contributes to Mobius, a multi-paradigm, multi-solution framework for the model-based dependability and performance assessment of systems.","PeriodicalId":187276,"journal":{"name":"2009 Sixth International Conference on the Quantitative Evaluation of Systems","volume":"19 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":"132985378","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 Performance Model of Zoned Disk Drives with I/O Request Reordering","authors":"Abigail S. Lebrecht, N. Dingle, W. Knottenbelt","doi":"10.1109/QEST.2009.31","DOIUrl":"https://doi.org/10.1109/QEST.2009.31","url":null,"abstract":"Disk drives are a common performance bottleneck in modern storage systems. To alleviate this, disk manufacturers employ a variety of I/O request scheduling strategies which aim to reduce disk head positioning time by dynamically reordering queueing requests. An analytical model of this phenomenon is best represented by an M/G/1 queue with queue length dependent service times. However, there is no general exact result for the response time distribution of this variety of queue with generalised service time distributions. In this paper, we present a novel approximation for the response time distribution of sucha queue. We then apply this method to the specific case of azoned disk drive which implements I/O request reordering. A key contribution is the derivation of realistic service time distributions with minimised positioning time. We derive analytical results for calculating not only the mean but also higher moments and the full distribution of I/O request response time. We validate our model against measurements from a real disk to demonstrate the accuracy of our approximation.","PeriodicalId":187276,"journal":{"name":"2009 Sixth International Conference on the Quantitative Evaluation of Systems","volume":"12 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":"132786702","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}