Invited paper
Timed Petri nets definitions, properties, and applications

https://doi.org/10.1016/0026-2714(91)90007-TGet rights and content

Abstract

In timed Petri nets, the transitions fire in “real-time”, i.e., there is a (deterministic or random) firing time associated with each transition, the tokens are removed from input places at the beginning of firing, and are deposited into output places when the firing terminates (they may be considered as remaining “in” the transitions for the firing time). Any “state” description of timed nets must thus take into account the distribution of tokens in places as well as in (firing) transitions, and the state space of timed nets can be quite different from the space of reachable markings. Performance analysis of timed nets is based on stationary probabilities of states. For bounded nets stationary probabilities are determined from a finite set of simultaneous linear equilibrium equations. For unbounded nets the state space is infinite, the set of linear equilibrium equations is also infinite and it must be reduced to a finite set of nonlinear equations for effective solution. Simple examples illustrate capabilities of timed Petri net models.

References (29)

  • R. Janicki et al.

    Concurrent and maximally concurrent evolution of nonsequential systems

    Theoretical Computer Science

    (1986)
  • T. Agerwala

    Putting Petri nets to work

    IEEE Computer

    (1979)
  • M. Ajmone Marsan et al.

    A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems

    ACM Trans. on Computer Systems

    (1984)
  • M. Ajmone Marsan et al.

    Generalized stochastic Petri nets revisited: random switches and priorities

  • Advances in Petri Nets 1986 (vol. 1: “Petri nets — central models and their properties”, vol. 2: “Petri nets — applications and relationship to other models of concurrency”)

  • J.B. Dugan et al.

    Extended stochastic Petri nets — applications and analysis

  • J.B. Dugan et al.

    The design of a unified package for the solution of stochastic Petri net models

  • D. Ferrari

    Computer systems performance evaluation

    (1978)
  • H.J. Genrich et al.

    System modeling with high-level Petri nets

    Theoretical Computer Science

    (1981)
  • M.A. Holliday et al.

    A generalized timed Petri net model for performance evaluation

  • K. Jensen

    High-level Petri nets

  • L. Kleinrock

    Queueing systems

    (1976)
  • P.M. Merlin et al.

    Recoverability of communication protocols — implications of a theoretical study

    IEEE Trans. on Communications

    (1976)
  • M.K. Molloy

    Performance analysis using stochastic Petri nets

    IEEE Trans. on Computers

    (1982)
  • Cited by (0)

    View full text