Performance evaluation of concurrent systems using timed petri nets

  • Authors:
  • Wlodzimierz M. Zuberek

  • Affiliations:
  • Department of Computer Science, Memorial University of Newfoundland, St. John's, Newfoundland, Canada A1C 5S7 and Institute of Computer Science, Warsaw Technical University, Warsaw, Poland 00-665

  • Venue:
  • CSC '85 Proceedings of the 1985 ACM thirteenth annual conference on Computer Science
  • Year:
  • 1985

Quantified Score

Hi-index 0.00

Visualization

Abstract

It is shown that the behavior of Petri nets with exponentially distributed firing times can be represented by labeled directed “state” graphs in which labels describe the probabilities of transitions between vertices of the graph. For bounded Petri nets the corresponding state graphs are finite, and are isomorphic to finite state Markov chains, stationary descriptions can thus be obtained by standard techniques. An immediate application of such a model is performance analysis of concurrent systems, and in particular queueing systems with exponentially distributed arrival and service times. A simple example of an interactive computer system model is used as an illustration of performance evaluation.