By Topic

Second International Conference on the Quantitative Evaluation of Systems (QEST'05)

19-22 Sept. 2005

Filter Results

Displaying Results 1 - 25 of 44
  • Second International Conference on the Quantitative Evaluation of Systems [front matter]

    Publication Year: 2005, Page(s):c1 - c11
    Request permission for commercial reuse | PDF file iconPDF (1013 KB)
    Freely Available from IEEE
  • Proceedings. Second International Conference on the Quantitative Evaluation of Systems

    Publication Year: 2005
    Request permission for commercial reuse | PDF file iconPDF (35 KB)
    Freely Available from IEEE
  • Second International Conference on the Quantitative Evaluation of Systems - Copyright

    Publication Year: 2005, Page(s):iv - ivv
    Request permission for commercial reuse | PDF file iconPDF (44 KB)
    Freely Available from IEEE
  • Second International Conference on the Quantitative Evaluation of Systems - Table of contents

    Publication Year: 2005, Page(s):iv - ivv
    Request permission for commercial reuse | PDF file iconPDF (44 KB)
    Freely Available from IEEE
  • Message from the General Chair

    Publication Year: 2005, Page(s):ix - ixx
    Request permission for commercial reuse | PDF file iconPDF (43 KB) | HTML iconHTML
    Freely Available from IEEE
  • Message from the Program Chairs

    Publication Year: 2005, Page(s): x
    Request permission for commercial reuse | PDF file iconPDF (76 KB) | HTML iconHTML
    Freely Available from IEEE
  • Organizers

    Publication Year: 2005, Page(s):xii - xiii
    Request permission for commercial reuse | PDF file iconPDF (24 KB)
    Freely Available from IEEE
  • Technical Program Committee

    Publication Year: 2005, Page(s):xiii - xiiii
    Request permission for commercial reuse | PDF file iconPDF (29 KB)
    Freely Available from IEEE
  • list-reviewer

    Publication Year: 2005, Page(s):xiv - xivv
    Request permission for commercial reuse | PDF file iconPDF (24 KB)
    Freely Available from IEEE
  • Formal executable descriptions of biological systems

    Publication Year: 2005, Page(s):2 - 11
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB) | HTML iconHTML

    The similarities between systems of living entities and systems of concurrent processes may support biological experiments in silico. Process calculi offer a formal framework to describe biological systems, as well as to analyse their behaviour, both from a qualitative and a quantitative point of view. A couple of little examples help us in showing how this can be done. We mainly focus our attenti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Introducing probability within state class analysis of dense-time-dependent systems

    Publication Year: 2005, Page(s):13 - 22
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (592 KB) | HTML iconHTML

    Several techniques have been proposed for symbolic enumeration and analysis of the state space of reactive systems with nondeterministic temporal parameters taking values within a dense domain. In a large part of these techniques, the state space is covered by collecting states within equivalence classes each comprised of a discrete logical location and a dense variety of clock valuations encoded ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the use of exact lumpability in partially symmetrical well-formed nets

    Publication Year: 2005, Page(s):23 - 32
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (336 KB) | HTML iconHTML

    Well-formed nets (WNs) have proved an efficient model for building quotient reachability graphs that can be used either for qualitative or performance analysis. However, local asymmetries often break any possibility of grouping states into classes, thus drastically reducing the interest of the approach. An efficient solution has been proposed for qualitative analysis, which relies on a separate re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fluid flow approximation of PEPA models

    Publication Year: 2005, Page(s):33 - 42
    Cited by:  Papers (73)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (352 KB) | HTML iconHTML

    In this paper we present a novel performance analysis technique for large scale systems modelled in the stochastic process algebra PEPA. In contrast to the well-known approach of analysing via continuous time Markov chains, our underlying mathematical representation is a set of coupled ordinary differential equations (ODEs). This analysis process supports all of the comhinators of the PEPA algebra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comparative analysis of bisimulation relations on alternating and non-alternating probabilistic models

    Publication Year: 2005, Page(s):44 - 53
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB) | HTML iconHTML

    We consider bisimulation and weak bisimulation relations in the context of the labeled Markov chains of Hansson and Jonsson, the concurrent labeled Markov chains of Philippou, Lee, and Sokolsky, and the probabilistic automata of Segala. We identify a taxonomy of bisimulation relations that captures the existing definitions for each one of the three models, and we compare the relations within each ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An approximation algorithm for labelled Markov processes: towards realistic approximation

    Publication Year: 2005, Page(s):54 - 61
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (384 KB) | HTML iconHTML

    Approximation techniques for labelled Markov processes on continuous state spaces were developed by Desharnais, Gupta, Jagadeesan and Panangaden. However, it has not been clear whether this scheme could be used in practice since it involves inverting a stochastic kernel. We describe a Monte Carlo based implementation scheme for this approximation algorithm. This is, to the best of our knowledge, t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Toward picture-perfect streaming on the Internet

    Publication Year: 2005, Page(s):63 - 72
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (376 KB) | HTML iconHTML

    Quality of service (QoS) in streaming of continuous media over the Internet is poor, which is partly due to variations in delays, bandwidth limitations, and packet losses. Although continuous media applications can tolerate some missing data, non-recoverable information loss degrades these applications' QoS. Consequently, a number of application areas have backed away from streaming of their conte... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The use of optimal filters to track parameters of performance models

    Publication Year: 2005, Page(s):74 - 83
    Cited by:  Papers (9)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (376 KB) | HTML iconHTML

    Autonomic computer systems react to changes in the system, including failures, load changes, and changed user behaviour. Autonomic control may be based on a performance model of the system and the software, which implies that the model should track changes in the system. A substantial theory of optimal tracking filters has a successful history of application to track parameters while integrating d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multisolution of complex performability models in the OsMoSys/DrawNET framework

    Publication Year: 2005, Page(s):85 - 94
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (376 KB) | HTML iconHTML

    In the last years some infrastructures and frameworks have been proposed to enable the compositional development of multiformalism models. The OsMoSys/DrawNET framework allows to develop and analyze complex performability models which are composed by several submodels expressed by means of different formal languages. In this paper we describe the approach to multisolution of multiformalism models ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluating the dependability of a LEO satellite network for scientific applications

    Publication Year: 2005, Page(s):95 - 104
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (808 KB) | HTML iconHTML

    Dependability is an important issue in LEO satellite networks. In this paper, we study the dependability of a proposed LEO satellite network for scientific data collection based on the Illinois observing nanosatellite (ION). In particular, we first use analytical techniques to determine the amount of radiation shielding and number of redundant components, such as batteries and regulators, needed t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the performance of D-redundant disk systems

    Publication Year: 2005, Page(s):105 - 112
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB) | HTML iconHTML

    In this paper we formally introduce the notion of a D-redundant disk system. The class of D-redundant systems includes the class of physically mirrored disks with D copies as well as the more recently introduced SR systems. We provide a very general lower bound on the average access time of any D-redundant system. Using the lower bound we show that that the SR systems of Yu et al. are within 15 pe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Steady state solution for models with geometric and finite support activity duration

    Publication Year: 2005, Page(s):114 - 123
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (384 KB) | HTML iconHTML

    This paper addresses steady state solution of discrete time stochastic models in which every activity duration is given either by a geometric or a finite support distribution. Finite support distributions can be described by discrete time phase type (DPH) distributions. The behaviour of the whole stochastic model is given by a discrete time Markov chain (DTMC). The DTMC is subject to the so-called... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A MAP fitting approach with independent approximation of the inter-arrival time distribution and the lag correlation

    Publication Year: 2005, Page(s):124 - 133
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (720 KB) | HTML iconHTML

    This paper proposes a two-step Markov arrival process (MAP) fitting approach, where the first step is the phase type fitting of the inter-arrival time and the second step is the approximation of the first n lag correlation values. Depending on the description of the arrival process to approximate various phase type fitting methods can be applied for the first step. In the second step the approxima... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximate analysis of stochastic models by self-correcting aggregation

    Publication Year: 2005, Page(s):134 - 143
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB) | HTML iconHTML

    We present an approximation algorithm for the analysis of large stochastic models. The fixed point iteration approach uses different approximate aggregations of the state space of a model. The stationary state probabilities of these aggregated models are calculated to derive refined aggregations which are used for the correction of the approximate aggregations. The presented method is then extende... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Model checking for survivability!

    Publication Year: 2005, Page(s):145 - 154
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB) | HTML iconHTML

    Business and social life have become increasingly dependent on large-scale communication and information systems. A partial or complete breakdown as a consequence of natural disasters or purposeful attacks might have severe impacts. Survivability refers to the ability of a system to recover from such disaster circumstances. Evaluating survivability should therefore be an important part of communic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Checking LTL properties of recursive Markov chains

    Publication Year: 2005, Page(s):155 - 164
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (384 KB) | HTML iconHTML

    We present algorithms for the qualitative and quantitative model checking of linear temporal logic (LTL) properties for recursive Markov chains (RMCs). Recursive Markov chains are a natural abstract model of procedural probabilistic programs and related systems involving recursion and probability. For the qualitative problem ("given a RMC A and an LTL formula φ, do the computations of A satisf... View full abstract»

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