Processes of place/transition-nets

  • U. Goltz
  • W. Reisig
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 154)


The idea of representing nonsequential processes as partially ordered sets (occurrence nets), is applied to place/transitions-nets (Petrinets), generalizing the well known notion of process for condition/ event-systems. For occurrence nets some theorems relating K-density, cut-finiteness and discreteness are proved. With these theorems we get the result that a place/transition-net is bounded if and only if its processes are K-dense.


Firing Sequence Transition Firing Token Count Causal Component Reachable Marking 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Be]
    E.Best: A Theorem on the Characteristics on Non-Sequential Processes. Fund. Informaticae, Vol. 3, No 1, pp.77–94 (1980).Google Scholar
  2. [BM]
    E. Best, A. Merceron: Discreteness, K-Density and D-Continuity of Occurrence Nets. 6th GI-Conference on theoretical computer science (January 1983), to appear.Google Scholar
  3. [FT]
    C. Fernandez, P.S. Thiagarajan: Some Properties of D-continuous Causal Nets. ICALP 1982, Lecture Notes in Computer Science 140 (July 1982).Google Scholar
  4. [GS]
    H.J. Genrich, E. Stankiewicz-Wiechno: A Dictionary of Some Basic Notions of Net Theory. Advanced Course on General Net Theory of Processes and Systems Hamburg, Lecture Notes in Computer Science 84, Springer Verlag 1980.Google Scholar
  5. [Gr]
    J. Grabowski: On Partial Languages. Preprint No. 40/79, Sekt. Mathematik, Humboldt-Univ. (October 1979).Google Scholar
  6. [Kn]
    D.E. Knuth: The Art of Computer Programming, Vol. 1: Fundamental Algorithms. Addison-Wesley Publishing Company, second edition 1973.Google Scholar
  7. [Ma]
    A. Mazurkiewicz: Concurrent Program Schemes and their Interpretation. Report DAIMI PB-78, Computer Science Department, Aarhus University, Aarhus, Denmark (1977).Google Scholar
  8. [Ni]
    M. Nielsen, G. Plotkin, G. Winskel: Petri Nets, Event Structures and Domains. Theoretical Computer Science, Vol. 13, pp. 85–108 (1981).Google Scholar
  9. [Pe]
    J.L. Peterson: Petri Net Theory and the Modeling of Systems, Prentice-Hall, Inc. 1981.Google Scholar
  10. [P1]
    C.A. Petri: Non-Sequential Processes. GMD-ISF Report 77-05 (1977).Google Scholar
  11. [P2]
    C.A. Petri: Concurrency. Lecture Notes in Computer Science Vol. 84, pp. 251–260 (1980).Google Scholar
  12. [P1]
    H. Plünnecke: Schnitte in Halbordnungen. GMD-ISF Report 81–09 (April 1981).Google Scholar
  13. [Re]
    W. Reisig: Processes of Marked, Arc-Weighted Nets. In: Petri Nets and Related System Models, Newsletter No. 5 (June 1980).Google Scholar
  14. [RV]
    G. Rozenberg, R. Verreadt: Subset Languages of Petri Nets. Third European Workshop on Applications and Theory of Petri Nets. Varenna, Sept. 27–30, 1982, to appear.Google Scholar
  15. [St]
    P. Starke: Processes in Petri Nets. In: Elektronische Informationsverarbeitung und Kybernetik, Vol. 17, No. 8–9 (1981).Google Scholar
  16. [Wi]
    J. Winkowski: An Algebraic Description of System Behaviours. Theoretical Computer Science, Vol. 21, Number 3, December 1982 pp. 315–340Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • U. Goltz
    • 1
  • W. Reisig
    • 1
  1. 1.Lehrstuhl für Informatik IIRWTH AachenAachen

Personalised recommendations