By Topic

Petri Nets and Performance Models, 1997., Proceedings of the Seventh International Workshop on

Date 3-6 June 1997

Filter Results

Displaying Results 1 - 25 of 26
  • Proceedings of the Seventh International Workshop on Petri Nets and Performance Models

    Publication Year: 1997
    Request permission for commercial reuse | PDF file iconPDF (440 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 1997, Page(s): 257
    Request permission for commercial reuse | PDF file iconPDF (43 KB)
    Freely Available from IEEE
  • Petri nets for modelling and evaluating deterministic and stochastic manufacturing systems

    Publication Year: 1997, Page(s):2 - 14
    Cited by:  Papers (5)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (972 KB)

    This paper is dedicated to the modelling and the evaluation of discrete event systems. We focus on manufacturing systems. The first part of the paper concerns cyclic manufacturing systems. The model of such a system is an event graph which encapsulates both the physical and the decision making system models. We propose approaches which aim at maximising the productivity while minimising the Work-I... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • “On-the-fly” solution techniques for stochastic Petri nets and extensions

    Publication Year: 1997, Page(s):132 - 141
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (900 KB)

    Use of a high-level modeling representation, such as stochastic Petri nets, frequently results in a very large state space. In this paper, we propose new methods that can tolerate such large state spaces and that do not require any special structure in the model. First, we develop methods that generate rows and columns of the state transition-rate-matrix on-the-fly, eliminating the need to explici... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of large GSPN models: a distributed solution tool

    Publication Year: 1997, Page(s):122 - 131
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1064 KB)

    Distributed computing systems, making available large memories and powerful computational resources allow the analysis of problems of unprecedented complexity. The exploitation of the potential offered by these systems highly depends upon the availability of efficient tools devoted to the solution of specific problems. The paper describes a distributed approach to the analysis of large GSPN models... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Steady-state analysis of infinite stochastic Petri nets: comparing the spectral expansion and the matrix-geometric method

    Publication Year: 1997, Page(s):36 - 45
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (916 KB)

    In this paper we investigate the efficiency of two solution approaches to infinite stochastic Petri nets: the matrix-geometric method and the spectral expansion method. We first informally present infinite stochastic Petri nets, after which we describe, using uniform notation, the matrix-geometric and the spectral expansion method. We put special emphasis on the numerical aspect of the solution pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance prediction of a reconfigurable high voltage substation simulator: a case study using SWN

    Publication Year: 1997, Page(s):163 - 172
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (960 KB)

    This paper presents the modeling and performance evaluation of a high voltage substation simulator with real time constraints, running on a multiprocessor architecture. The Stochastic Well-formed Net models of the simulator and of the target multiprocessor have been designed with the goal of providing guidelines as well as automatic tools for the generalization to several software and hardware con... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Estimation methods for stochastic Petri nets based on standardized time series

    Publication Year: 1997, Page(s):194 - 204
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1124 KB)

    When a computer manufacturing telecommunication or transportation system is modeled as a stochastic Petri net, many long-run performance characteristics of interest can be represented as time-average limits of the underlying marking process. For nets with generally-distributed firing times such limits typically cannot be computed analytically or numerically, but must be estimated using simulation.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • State space construction and steady-state solution of GSPNs on a shared-memory multiprocessor

    Publication Year: 1997, Page(s):112 - 121
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1044 KB)

    A common approach for the quantitative analysis of a generalized stochastic Petri net (GSPN) is to generate its entire state space and then solve the corresponding continuous-time Markov chain (CTMC) numerically. This analysis often suffers from two major problems: the state space explosion and the stiffness of the CTMC. In this paper we present parallel algorithms for shared-memory machines that ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reliability analysis of a redundant database for UMTS systems

    Publication Year: 1997, Page(s):247 - 256
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (976 KB)

    The Universal Mobile Telecommunication System (UMTS) is anticipated to provide mobile users with new broadband services such as wireless multimedia, including real-time video and high-speed data. In this system, the requirement on service transparency placed by the handling of mobility, both personal and terminal, implies a remarkable increase in the complexity of data management. Therefore, appro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • GSPN semantics for queueing networks with blocking

    Publication Year: 1997, Page(s):26 - 35
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (984 KB)

    Queuing network models with finite capacity queues and blocking are used to represent systems with finite capacity resource constraints, such as production, communications and computer systems. Various blocking mechanisms have been defined in the literature to represent the different behaviours of real systems with limited resources. In this paper we propose a technique that allows to represent th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Timed Petri net models of multithreaded multiprocessor architectures

    Publication Year: 1997, Page(s):153 - 162
    Cited by:  Papers (9)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1016 KB)

    Multithreaded distributed-memory multiprocessor architectures are composed of a number of (multithreaded) processors, each with its memory, and an interconnection network. The long memory latencies and unpredictable synchronization delays are tolerated by context switching, i.e., by suspending the current thread and switching the processor to another `ready' thread provided such a thread is availa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fourth-order algorithm with automatic stepsize control for the transient analysis of DSPNs

    Publication Year: 1997, Page(s):60 - 69
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1008 KB)

    This paper presents on efficient and numerically reliable method for the transient analysis of DSPNs. An analysis algorithm based on the method of supplementary variables is redesigned in order to improve its efficiency (with respect to both CPU-time and memory space) and its numerical quality (control of numerical errors) and to remove earlier restrictions (concerning the initial enabling of dete... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploiting stochastic process algebra achievements for generalized stochastic Petri nets

    Publication Year: 1997, Page(s):183 - 192
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1004 KB)

    Constructing large generalized stochastic Petri nets (GSPN) by hierarchical composition of smaller components is a promising way to cope with the complexity of the design process for models of real hardware and software systems. The composition of nets is inspired by process algebraic operators. A solid theoretical framework of such operators relies on equivalences that are substitutive with respe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hierarchical structuring of superposed GSPNs

    Publication Year: 1997, Page(s):81 - 90
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1128 KB)

    Superposed Generalized Stochastic Petri Nets (SGSPNs) and Stochastic Automata Networks (SANs) are formalisms to describe Markovian models as a collection of synchronously communicating components. Both formalisms allow a compact representation of the generator matrix of the Markov chain which can be exploited for very space efficient analysis techniques. The main drawback of the approaches is that... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Transient analysis of superposed GSPNs

    Publication Year: 1997, Page(s):101 - 110
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1004 KB)

    The paper considers transient analysis using randomization for superposed generalized stochastic Petri nets (GSPNs). Since state space explosion implies that space is the bottleneck for numerical analysis, super-posed GSPNs profit from the structured representation known for its associated Markov chain. This moves the bottleneck for analysis from space for generator matrices to space for iteration... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • GSPN models of ATM switches

    Publication Year: 1997, Page(s):237 - 246
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (968 KB)

    The paper presents examples of the application of the generalised stochastic Petri net (GSPN) modeling paradigm to the performance analysis of ATM networks, illustrating modular GSPN models of two well-known ATM switch architectures: the Knockout and the Gauss switches. The approach is based on the use of many immediate transitions, and only one timed transition, whose firing time distribution is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Aggregation and disaggregation in product form queueing Petri Nets

    Publication Year: 1997, Page(s):16 - 25
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (988 KB)

    Product from queueing Petri Nets (PQPNs) combine the results of product form for Stochastic Petri Nets with the well-known BCMP results in one modeling formalism and include them as special cases. In this paper we establish an exact aggregation approach, based on the product form, which extends Norton's theorem for aggregation in multi-class product form Queueing Networks View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance evaluation of a consensus algorithm with Petri nets

    Publication Year: 1997, Page(s):143 - 152
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (924 KB)

    This paper presents an application of Hierarchical Coloured Timed Petri Nets to the modeling, the evaluation and the improvement of the performance of a distributed consensus algorithm. The asynchronous system model is augmented with Failure Suspectors, in order to overcome the impossibility of reaching consensus in the presence of crash failures. We consider here two different implementations of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling of hybrid systems using continuous and hybrid Petri nets

    Publication Year: 1997, Page(s):47 - 58
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (944 KB)

    We shall first try to define what is meant by a hybrid system. Petri nets are, by definition, discrete event systems. However, continuous Petri nets have subsequently been defined. Both models can be combined to produce what are known as hybrid Petri nets. These continuous and hybrid nets are used to model hybrid systems whether or not time is taken into account. These models are explained intuiti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Throughput approximation of decision free processes using decomposition

    Publication Year: 1997, Page(s):174 - 182
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (752 KB)

    We present an approach for the efficient approximation of the throughput of decision free processes, a class of stochastic process algebra models. Stochastic process algebras are modeling formalisms which are based on communicating sequential processes, in contrast to stochastic Petri nets which focus on causality and concurrency. The algorithm we are using is based on model decomposition at the s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Time Warp simulation of timed Petri nets: sensitivity of adaptive methods

    Publication Year: 1997, Page(s):205 - 216
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1064 KB)

    The unthrottled optimism underlying the Time Warp (TW) parallel simulation protocol can lead to excessive aggressiveness in memory consumption due to saving state histories, and waste of CPU cycles due to overoptimistically progressing simulations that eventually have to be “rolled back”. Furthermore, in TW simulations executing in distributed memory environments, the communication ove... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New primitives for interlaced memory policies in Markov regenerative Stochastic Petri Nets

    Publication Year: 1997, Page(s):70 - 79
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (852 KB)

    The non-Markovian Stochastic Petri Net (SPN) models appeared so far in the literature, are based on the assumption that the underlying marking process can be specified by assigning an individual memory policy to each timed transition. The present paper proposes to introduce interlaced, or state dependent, memory policies, where the memory of a transition can be modified by the occurrence of some c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Discrete-event simulation of fluid stochastic Petri nets

    Publication Year: 1997, Page(s):217 - 225
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (676 KB)

    The purpose of the paper is to describe a method for the simulation of recently introduced fluid stochastic Petri nets. Since such nets result in a rather complex set of partial differential equations, numerical solution becomes a formidable task. Because of a mixed, discrete and continuous state space, simulative solution also poses some interesting challenges, which are addressed in the paper View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Structured solution of stochastic DSSP systems

    Publication Year: 1997, Page(s):91 - 100
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (884 KB)

    Deterministically Synchronized Sequential Processes (DSSP) are essentially states machines that communicate, may be in complex forms but under some restricted patterns, through buffer places; their definition is compositional by nature. This paper considers the problem of exploiting this compositionality to generate the state space and to find the steady state probabilities of a stochastic extensi... View full abstract»

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