Advertisement

The semantics of capacities in P/T nets

  • Raymond Devillers
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 424)

Abstract

Various candidate rules for defining the enabling conditions for transition firing in a P/T net with capacities are examined. Various points of view are successively considered: external, internal, place-complementation, concurrency, process semantics and expressive power. It is shown that the corresponding behaviours may be rather different, but that, at least for the main ones, they have essentially the same expressive power.

Key words

P/T nets enabling rule capacity concurrency languages 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    C. ANDRE: Structural Transformations Giving B-Equivalent PT-Nets, Third European Workshop on Application and Theory of Petri Nets, Varenna; Pagnoni, Rozenberg eds. (1982)Google Scholar
  2. [2]
    E. BEST: Concurrent Behaviour: Sequences, Processes and Axioms, Arbeitspapiere des GMD, nr 118, GMD Bonn (1984)Google Scholar
  3. [3]
    E. BEST: Weighted Basic Petri Nets, in:Concurrency 88 (F.H. Vogt ed.), LNCS 335, Springer Verlag (1988), pp 257–276Google Scholar
  4. [4]
    E. BEST and R. DEVILLERS: Sequential and Concurrent Behaviour in Petri Net Theory, TCS 55 (1987), pp 87–136Google Scholar
  5. [5]
    E. BEST and C. FERNANDEZ: Notations and Terminology on Petri Net Theory, Arbeitspapiere des GMD, nr 195, GMD Bonn (1986)Google Scholar
  6. [6]
    W. BRAUER: How to Play the Token Game? or Difficulties in Interpreting Place Transition Nets, Petri Nets and Related System Models Newsletter 16 (1984), pp 3–13Google Scholar
  7. [7]
    R. DEVILLERS: The Semantics of Capacities in P/T Nets: a First Look, Proceedings of the 6th Workshop on Petri Nets, Helsinski (1985), pp 171–190Google Scholar
  8. [8]
    R. DEVILLERS: The Expressive Power of Various Enabling rules for P/T Nets, TR161-LIT, Université Libre de Bruxelles (1985)Google Scholar
  9. [9]
    H.J. GENRICH and E. STANKIEWICZ-WIECHNO: A dictionnary of Some Basic Notions of Net Theory, in: Net Theory and Applications (Brauer ed.), LNCS 84, Springer Verlag (1980), pp 519–533Google Scholar
  10. [10]
    U. GOLTZ and W. REISIG: The Non-Sequential Behaviour of Petri Nets, Information and Control, Vol. 57, nr 2–3 (1983), pp 125–147Google Scholar
  11. [11]
    M. HACK: Petri Net Languages, TR-159, MIT (1976)Google Scholar
  12. [12]
    M. JANTZEN and R. VALK: Formal Properties of Place/Transition Nets, in: Net Theory and Applications (Brauer ed.), LNCS 84, Springer Verlag (1980), pp 165–212Google Scholar
  13. [13]
    E. JESSEN and R. VALK: Rechensysteme, Springer Verlag (1987)Google Scholar
  14. [14]
    A. KIEHN: On the Concurrent Behaviour of Petri Nets, Bericht 120, FI-Universität Hamburg (1986)Google Scholar
  15. [15]
    A. MAZURKIEWICZ: Trace Theory, in: Petri Nets: Applications and Relationships to Other Models of Concurrency. Advances in Petri Nets 1986, Part II (Brauer, Reisig and Rozenberg eds.), LNCS 255, Springer Verlag (1986), pp 279–324Google Scholar
  16. [16]
    E. OCHMANSKI: Occurrence Traces, Processes of Elementary Net Systems, TR-Polish Academy of Sciences (1988)Google Scholar
  17. [17]
    W. REISIG: On the Semantics of Petri Nets, in: Formal Models in Programming, IFIP 1985 (Neuhold E.J. and Chroust G., eds.), North Holland (1985), pp 347–372Google Scholar
  18. [18]
    W. REISIG: Petri Nets, EATCS monography, Springer Verlag (1985)Google Scholar
  19. [19]
    G. ROZENBERG: Behaviour of EN-Systems, in: Petri Nets: Central Models and their Properties. Advances in Petri Nets 1986, Part I (Brauer, Reisig and Rozenberg eds.), LNCS 254, Springer Verlag (1986), pp 60–94Google Scholar
  20. [20]
    P.S. THIAGARAJAN: Elementary Net Systems, in: Petri Nets: Central Models and their Properties. Advances in Petri Nets 1986, Part I (Brauer, Reisig and Rozenberg eds.), LNCS 254, Springer Verlag (1986), pp 26–59Google Scholar
  21. [21]
    G. WINSKEL: Categories of Models for Concurrency, TR 58, University of Cambridge (1984)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Raymond Devillers
    • 1
  1. 1.Laboratoire d'Informatique théoriqueUniversité Libre de Bruxelles Campus Plaine — Boulevard du TriompheBruxellesBelgium

Personalised recommendations