By Topic

Proceedings 6th International Workshop on Petri Nets and Performance Models

3-6 Oct. 1995

Filter Results

Displaying Results 1 - 25 of 35
  • Proceedings 6th International Workshop on Petri Nets and Performance Models

    Publication Year: 1995
    Request permission for commercial reuse | PDF file iconPDF (146 KB)
    Freely Available from IEEE
  • Preemptive repeat identical transitions in Markov regenerative stochastic Petri nets

    Publication Year: 1995, Page(s):113 - 122
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (893 KB)

    Recent literature on Markov regenerative stochastic Petri nets (MRSPN) assumes that the random firing time associated to each transition is resampled each time the transition fires or is disabled by the firing of a competitive transition. This modeling assumption does not cover the case of preemption mechanisms of repeat identical nature (PRI). In this policy, an interrupted job must be repeated w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Characterization of timed well-formed Petri nets behavior by means of occurrence equations

    Publication Year: 1995, Page(s):127 - 136
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1066 KB)

    So called "recursive equations" have been introduced by Baccelli et al. (1992) as a convenient way of characterizing the behavior of stochastic Petri net models in terms of transition firing instances and of creation and destruction times for tokens in places. Such equations have been used to prove model properties as well as to speed up simulation by parallel processing techniques in the case of ... View full abstract»

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

    Publication Year: 1995
    Request permission for commercial reuse | PDF file iconPDF (51 KB)
    Freely Available from IEEE
  • Evaluation of high level Petri nets by means of aggregation and decomposition

    Publication Year: 1995, Page(s):11 - 20
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (844 KB)

    We introduce a new method combining the powerful stochastic well formed Petri net (SWN) model with the decomposition approach initiated by B. Plateau (1985). We derive necessary conditions on the modeled systems that allow for the two methods to be combined. For parallel systems satisfying these necessary conditions we develop two models with corresponding algorithms. The first model, which forbid... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the success of stochastic Petri nets

    Publication Year: 1995, Page(s):2 - 9
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (856 KB)

    Stochastic Petri nets (SPNs) are discussed from the point of view of the results that have contributed most to the dissemination of this formalism. The historical context in which SPN ideas have developed is briefly reviewed to recount the motivations that have driven this research field and to show how its success has been recognized by the scientific community. A few directions of research are d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Timing analysis for synthesis of hardware interface controllers using timed signal transition graphs

    Publication Year: 1995, Page(s):232 - 240
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (704 KB)

    The work addresses the design of hardware interface controllers for microprocessor-based systems. Interface design is required during the system integration phase to interconnect components which may use different interfacing protocols. It is shown that both the component interfacing protocols and the interface design can be described using an interpreted timed Petri net. Traditionally verificatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling computer systems evolutions: non-stationary processes and stochastic Petri nets-application to dependability growth

    Publication Year: 1995, Page(s):221 - 230
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (844 KB)

    Stochastic Petri nets (SPNs) have emerged over the years as a favored approach for performance and dependability modeling and evaluation. Their usual utilization assumes that systems specification and design do not evolve, in opposition to real-life. This paper is aimed at a preliminary exploration of how to take advantage of the existing body of results on SPNs for modeling the evolution of compu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • TOMSPIN-a Tool for Modelling with Stochastic Petri Nets

    Publication Year: 1995, Page(s):218 - 219
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (196 KB)

    The basic objective of TOMSPIN (Tool for Modelling with Stochastic Petri Nets) is to provide industrial users with a tool that can analyse fairly big systems using GSPN (Generalized Stochastic Petri Nets) models with some slight extensions. The front-end of TOMSPIN consists of a hierarchically structured net description language, with an optional graphical editor. After transforming the net into a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximate mean value analysis technique for non-product form solution stochastic Petri nets: an application to stochastic marked graphs

    Publication Year: 1995, Page(s):42 - 51
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (796 KB)

    An iterative technique for the computation of approximate performance indices of a class of stochastic Petri nets models is presented. The proposed technique is derived from the Mean Value Analysis algorithm for product form solution stochastic Petri nets. We apply the approximation technique to stochastic marked graphs. Several examples are presented in order to validate the approximate results View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance optimization of event graphs modeling manufacturing systems

    Publication Year: 1995, Page(s):203 - 204
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (104 KB)

    The objective of the paper is to show that relatively complex manufacturing systems can be modeled as time event graphs and that significant optimization problems can be stated and solved using this representation. Particular attention is focused on the multi-objective optimization of the system throughput, and of a function weighting the work-in-progress along with the buffer space in finite buff... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Giving a net semantics to Markovian process algebra

    Publication Year: 1995, Page(s):169 - 178
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (836 KB)

    We define two compositional net semantics for the stochastic process algebra Markovian process algebra (MPA), based on a class of stochastic Petri nets. The first semantics is operational in style and is defined by structural induction. We prove that both the functional and performance interleaving semantics are retrievable: given a process term E, the reachability graph and the Markov chain obtai... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance evaluation of non-Markovian stochastic event graphs

    Publication Year: 1995, Page(s):94 - 102
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (604 KB)

    The computation of transitions firing rates of a stochastic event graph is equivalent to the computation of the completion time of some PERT network. We describe a low polynomial complexity algorithm that provides bounds and approximation of any firing rate using properties of integral orderings among random variables. We test the algorithm on some examples and discuss its use for the computation ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • UltraSAN version 3 overview

    Publication Year: 1995, Page(s):216 - 217
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (188 KB)

    UltraSAN is a software package for model-based evaluation of systems represented as stochastic activity networks. The software has been implemented in a modular fashion, with clearly delineated interfaces between model specification, construction, and solution. UltraSAN offers an X Windows-based user interface and both analytical and simulation solution modules for transient and steady-state perfo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient simulation of SWN models

    Publication Year: 1995, Page(s):137 - 146
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (892 KB)

    Coloured Petri nets are a powerful formalism for the description of complex, asynchronous distributed systems. They can express in a very concise way the behaviour of very large system especially in case these systems are composed of many replications of a few basic components that individually behave in a similar way. The simulation of such models is however difficult to perform in a computationa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Numerical analysis of stochastic marked graph nets

    Publication Year: 1995, Page(s):32 - 41
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (952 KB)

    The analysis of stochastic marked graphs is considered. The underlying idea is to decompose the marked graph into subnets, to generate state spaces and transition matrices for these isolated parts and then to represent the generator matrix underlying the complete net by means of much smaller subnet matrices combined via tensor operations. Based on this matrix representation, efficient numerical an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Numerical evaluation of a group-oriented multicast protocol using stochastic activity networks

    Publication Year: 1995, Page(s):63 - 72
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1032 KB)

    Group-oriented multicast protocols that provide message ordering and delivery guarantees are becoming increasingly important in distributed system design. However, despite the large number of such protocols, little analytical work has been done concerning their performance, especially in the presence of message loss. This paper illustrates a method for determining the performability of group-orien... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • One-dependent cycles and passage times in stochastic Petri nets

    Publication Year: 1995, Page(s):191 - 202
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1080 KB)

    The lengths of certain passage-time intervals (random time intervals) in stochastic Petri nets correspond to delays in computer, communication, manufacturing, and transportation systems. Simulation is often the only available means for analyzing a sequence of such lengths. It is sometimes possible to obtain meaningful estimates for the limiting average delay indirectly, that is, without measuring ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A comparison of performance evaluation process algebra and generalized stochastic Petri nets

    Publication Year: 1995, Page(s):158 - 168
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1112 KB)

    Generalized stochastic Petri nets (GSPN) and performance evaluation process algebra (PEPA) can both be used to study qualitative and quantitative behaviour of systems in a single environment. The paper presents a comparison of the two formalisms in terms of the facilities that they provide to the modeller; considering both the definition and the analysis of the performance model. Our goal is to pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling a scalable high-speed interconnect with stochastic Petri nets

    Publication Year: 1995, Page(s):83 - 92
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (772 KB)

    This paper presents an approach to using Stochastic Petri nets to model large-scale concurrent systems, in our case, a scalable computer interconnect. We show how Stochastic Petri net models can exploit the symmetry of the system to construct a tractable, but approximate, analytic model, and that they can yield results very close to those of a detailed simulation model, with much less computationa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The fluid stochastic Petri net simulator

    Publication Year: 1995, Page(s):214 - 215
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (172 KB)

    A Fluid Stochastic Petri Net (FSPN) extends a normal Petri net with the notion of fluid places, and fluid arcs. Fluid levels are continuous, and may be used to approximate the presence of many discrete tokens. We describe an FSPN simulation tool whose input description extends the syntax of the widely used tool spnp View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • TimeNET-a toolkit for evaluating non-Markovian stochastic Petri nets

    Publication Year: 1995, Page(s):210 - 211
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (120 KB)

    Stochastic Petri nets are well suited for the model-based performance and dependability evaluation of complex systems. Most commonly, the firing times of the transitions are exponentially distributed, leading to an underlying continuous-time Markov chain. In order to increase the modeling power, several classes of non-Markovian SPNs were defined, in which the transitions may fire after a nonexpone... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fixed point iteration using stochastic reward nets

    Publication Year: 1995, Page(s):21 - 30
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (780 KB)

    Stochastic Petri net models of large systems that are solved by generating the underlying Markov chain pose the problem of largeness of the state-space. Hierarchical and iterative models of systems have been used extensively to solve this problem. A problem with models which use fixed point iteration is the theoretical proof of existence, uniqueness, and convergence of the fixed point equations, w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance evaluation of dynamic priority operating systems

    Publication Year: 1995, Page(s):241 - 250
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (888 KB)

    Operating systems which implement a dynamic priority mechanism are very common. Nevertheless, it is very difficult to develop an accurate analytical model to evaluate their performance, mainly due to the different forms of dependency between the various constituent parts. We introduce a black box modeling approach which allows us to identify and decompose the different functions of the operating s... View full abstract»

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

    Publication Year: 1995, Page(s):52 - 61
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (944 KB)

    The numerical analysis of various modeling formalisms profits from a structured representation for the generator matrix Q of the underlying continuous time Markov chain, where Q is described by a sum of tensor (kronecker) products of much smaller matrices. In this paper we describe such a representation for the class of superposed generalized stochastic Petri nets (SGSPNs). Furthermore a new itera... View full abstract»

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