2011 Eighth International Conference on Quantitative Evaluation of SysTems

5-8 Sept. 2011

Filter Results

Displaying Results 1 - 25 of 44
  • [Front cover]

    Publication Year: 2011, Page(s): C1
    Request permission for commercial reuse | |PDF file iconPDF (1282 KB)
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2011, Page(s): i
    Request permission for commercial reuse | |PDF file iconPDF (11 KB)
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2011, Page(s): iii
    Request permission for commercial reuse | |PDF file iconPDF (51 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2011, Page(s): iv
    Request permission for commercial reuse | |PDF file iconPDF (108 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2011, Page(s):v - vii
    Request permission for commercial reuse | |PDF file iconPDF (150 KB)
    Freely Available from IEEE
  • Message from the General Chair

    Publication Year: 2011, Page(s): viii
    Request permission for commercial reuse | |PDF file iconPDF (275 KB) | HTML iconHTML
    Freely Available from IEEE
  • Message from the Program Committee Co-chairs

    Publication Year: 2011, Page(s):ix - x
    Request permission for commercial reuse | |PDF file iconPDF (2371 KB) | HTML iconHTML
    Freely Available from IEEE
  • Organizing Committee

    Publication Year: 2011, Page(s): xi
    Request permission for commercial reuse | |PDF file iconPDF (28 KB)
    Freely Available from IEEE
  • Technical Program Committee

    Publication Year: 2011, Page(s): xii
    Request permission for commercial reuse | |PDF file iconPDF (27 KB)
    Freely Available from IEEE
  • Reviewers

    Publication Year: 2011, Page(s): xiii
    Request permission for commercial reuse | |PDF file iconPDF (54 KB)
    Freely Available from IEEE
  • Hybrid Limits of Continuous Time Markov Chains

    Publication Year: 2011, Page(s):3 - 12
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (744 KB) | HTML iconHTML

    We consider the behaviour of sequences of Continuous Time Markov Chains (CTMC) based models of systems of interacting entities, for increasing population levels, in situations when some transitions of the system have rates that are discontinuous functions. This can happen, for instance, in presence of guarded actions. In this setting, standard deterministic approximation results do not apply. Howe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fluid Limits Applied to Peer to Peer Network Analysis

    Publication Year: 2011, Page(s):13 - 20
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (392 KB) | HTML iconHTML

    The objective of several techniques including fluid limits and mean field approximations is to analyze a stochastic complex system (e.g. Markovian) studying a simplified model (deterministic, represented by ordinary differential equations (ODEs)). In this paper, we explore models proposed for the analysis of BitTorrent P2P systems and we provide the arguments to justify the passage from the stocha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fluid Analysis of Queueing in Two-Stage Random Environments

    Publication Year: 2011, Page(s):21 - 30
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (293 KB) | HTML iconHTML

    A large number of random environments leads to Markov processes where average-environment (AVG) and near-complete-decomposability (DEC) approximations suffer unacceptably large errors. This is problematic for queueing networks in particular, where state-space explosion hinders the application of numerical methods. In this paper we introduce blending, a novel fluid-based approximation for queueing ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Temperature-aware Real-Time Scheduling - Extended Abstract

    Publication Year: 2011, Page(s):33 - 34
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (109 KB) | HTML iconHTML

    Power density has been continuously increasing in modern processors, leading to high on-chip temperatures. A system could fail if the operating temperature exceeds a certain threshold, leading to low reliability and even chip burnout. Recently, many results related to thermal management have been described, including thermal-constrained scheduling to maximize performance or schedulability of real-... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Tool for Scalable Profiling and Tracing of Java and Native Code Interactions

    Publication Year: 2011, Page(s):37 - 46
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (501 KB) | HTML iconHTML

    Java workloads have two different execution spaces: one in JVM and the other in the native environment. Understanding workload activity in native and non-native (Java) spaces and its impact on the overall resource consumption of Java workloads can be very useful. For example, this knowledge can be exploited in code optimization and for efficient process level scheduling especially in emerging hybr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Hybrid Approach for Large Cache Performance Studies

    Publication Year: 2011, Page(s):47 - 56
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (414 KB) | HTML iconHTML

    Recent technology trends are leading to the possibility of computer systems having last level caches significantly larger than those that exist today. Traditionally, cache effectiveness has been modeled through trace-driven simulation tools, however, these tools are not up to the task of modeling very large caches. Because of the limited length of available traces, the tools cannot capture behavio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive Gridding for Abstraction and Verification of Stochastic Hybrid Systems

    Publication Year: 2011, Page(s):59 - 68
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (359 KB) | HTML iconHTML

    This work is concerned with the generation of finite abstractions of general Stochastic Hybrid Systems, to be employed in the formal verification of probabilistic properties by means of model checkers. The contribution employs an abstraction procedure based on a partitioning of the state space, and puts forward a novel adaptive gridding algorithm that is expected to conform to the underlying dynam... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Game-based Abstraction and Controller Synthesis for Probabilistic Hybrid Systems

    Publication Year: 2011, Page(s):69 - 78
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (349 KB) | HTML iconHTML

    We consider a class of hybrid systems that involve random phenomena, in addition to discrete and continuous behaviour. Examples of such systems include wireless sensing and control applications. We propose and compare two abstraction techniques for this class of models, which yield lower and upper bounds on the optimal probability of reaching a particular class of states. We also demonstrate the a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Discrete-Time Verification and Control for Probabilistic Rectangular Hybrid Automata

    Publication Year: 2011, Page(s):79 - 88
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (361 KB) | HTML iconHTML

    Hybrid automata provide a modeling formalism for systems characterized by a combination of discrete and continuous components. Probabilistic rectangular automata generalize the class of rectangular hybrid automata with the possibility of representing random behavior of the discrete components of the system. We consider the following two problems regarding probabilistic rectangular automata: verifi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MARCIE - Model Checking and Reachability Analysis Done EffiCIEntly

    Publication Year: 2011, Page(s):91 - 100
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (417 KB) | HTML iconHTML

    MARCIE is a multi-threaded tool for the analysis of Generalized Stochastic Petri Nets. Its capabilities range from standard properties of qualitative Petri nets to CTL and CSL model checking, recently extended by rewards. The core of MARCIE builds upon Interval Decision Diagrams for the symbolic representation of marking sets of bounded Petri nets (finite state space) and on-the-fly matrix computa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Probe Automata for Passage Time Specification

    Publication Year: 2011, Page(s):101 - 110
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (313 KB) | HTML iconHTML

    Passage time distribution has drawn increasing attention over the past years as an important measure to define and verify service level agreements. The definition of passage time requires the specification of a condition to start/stop the computation, and possibly of a restriction on the system behavior to be considered between start and stop. Different characterizations have been defined in the p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Learning Probabilistic Automata for Model Checking

    Publication Year: 2011, Page(s):111 - 120
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (309 KB) | HTML iconHTML

    Obtaining accurate system models for verification is a hard and time consuming process, which is seen by industry as a hindrance to adopt otherwise powerful model driven development techniques and tools. In this paper we pursue an alternative approach where an accurate high-level model can be automatically constructed from observations of a given black-box embedded system. We adapt algorithms for ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Model Checking MDPs with a Unique Compact Invariant Set of Distributions

    Publication Year: 2011, Page(s):121 - 130
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (299 KB) | HTML iconHTML

    The semantics of Markov Decision Processes (MDPs), when viewed as transformers of probability distributions, can described as a labeled transition system over the probability distributions over the states of the MDP. The MDP can be seen as defining a set of executions, where each execution is a sequence of probability distributions. Reasoning about sequences of distributions allows one to express ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Probabilistic Model Checking of Non-Markovian Models with Concurrent Generally Distributed Timers

    Publication Year: 2011, Page(s):131 - 140
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (304 KB) | HTML iconHTML

    In the analysis of stochastic concurrent timed models, probabilistic model checking combines qualitative identification of feasible behaviors with quantitative evaluation of their probability. If the stochastic process underlying the model is a Continuous Time Markov Chain (CTMC), the problem can be solved by leveraging on the memoryless property of exponential distributions. However, when multipl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • COSMOS: A Statistical Model Checker for the Hybrid Automata Stochastic Logic

    Publication Year: 2011, Page(s):143 - 144
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (220 KB) | HTML iconHTML

    This tool paper introduces Cosmos, a statistical model checker for the Hybrid Automata Stochastic Logic (HASL). HASL employs Linear Hybrid Automata (LHA), a gen eralization of Deterministic Timed Automata (DTA), to describe relevant execution paths of a Discrete Event Stochastic Process (DESP), a class of stochastic models which includes, but is not limited to, Markov chains. As a result HASL veri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.