Advertisement

On net systems generated by process foldings

  • Einar Smith
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 524)

Abstract

This paper is concerned with the general relationship between distributed structure and nonsequential behaviour of condition-event type Petri nets. It is shown that a class of net systems which includes all CE-systems can be formally constructed from a behavioural specification given in terms of labelled occurrence nets. Correspondingly the usual process definition is adapted to be compatible also with general (not necessarily contact free) CE-systems. The modelling power of this extension is discussed.

Keywords

Concurrent Processes Quotient Nets Elementary Petri Systems Contacts 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    E. Best, C. Fernández: Notations and Terminology on Petri Net Theory. Arbeitspapiere der GMD Nr. 195 (2. Auflage) — St. Augustin: Gesellschaft für Mathematik und Datenverarbeitung mbH (1987)Google Scholar
  2. [2]
    E. Best, C. Fernández C.: Nonsequential Processes. A Petri Net View. EATCS Series “Monographs in Theoretical Computer Science” Vol. 13. — Springer-Verlag (1988)Google Scholar
  3. [3]
    P.M. Cohn: Universal Algebra. — Dordrecht: D. Reidel Publishing Company (1985)Google Scholar
  4. [4]
    C. Fernández, M. Nielsen, P.S. Thiagarajan: Notions of Realizable Non-Sequential Processes. Fundamenta Informaticae IX, S. 421–454 (1986)Google Scholar
  5. [5]
    C. Fernández, P.S. Thiagarajan: A Lattice Theoretic View of K-Density. Lecture Notes in Computer Science Vol. 188: Advances in Petri Nets 1984 / G. Rozenberg (ed.) — Berlin: Springer-Verlag, S. 139–153 (1985)Google Scholar
  6. [6]
    H.J. Genrich, K. Lautenbach, P.S. Thiagarajan: Elements of General Net Theory. Lecture Notes in Computer Science Vol. 84. — Springer-Verlag, S. 21–163 (1980)Google Scholar
  7. [7]
    E. Ochmanski: Occurrence Traces. Lecture Notes in Computer Science Vol. 340: Advances in Petri Nets 1988 / G. Rozenberg (ed.) — Berlin: Springer-Verlag, S. 331–342 (1988)Google Scholar
  8. [8]
    C.A. Petri: Concepts of Net Theory. Mathematical Foundations of Computer Science: Proc. of Symposium and Summer School, High Tatras, Sept. 3–8, 1973, — Math. Inst. of the Slovak Acad. of Sciences, S. 137–146 (1973)Google Scholar
  9. [9]
    W. Reisig: Petri-Nets. EATCS Series “Monographs in Theoretical Computer Science” Vol. 4. — Springer-Verlag (1985)Google Scholar
  10. [10]
    E. Smith: Kausalität und Temporalität bei der Modellbildung. Informatik-Fachberichte Nr. 150 / J. Halin (ed.) — Berlin: Springer-Verlag, pp. 127–134 (1987)Google Scholar
  11. [11]
    E. Smith: Zur Bedeutung der Concurrency-Theorie für den Aufbau hochverteilter Systeme. Bericht der Gesellschaft für Mathematik und Datenverarbeitung Nr. 180 — München: R. Oldenbourg Verlag (1989)Google Scholar
  12. [12]
    E. Smith, W. Reisig: The Semantics of a Net is a Net — An Exercise in General Net Theory. Concurrency and Nets / K. Voss, H.J. Genrich, G. Rozenberg (eds.), Advances in Petri Nets. — Berlin: Springer-Verlag, S. 461–480 (1987)Google Scholar
  13. [13]
    P.S. Thiagarajan: Elementary Net Systems. Lecture Notes in Computer Science Vol. 254. — Springer-Verlag, pp. 26–59 (1987)Google Scholar
  14. [14]
    G. Winskel: A New Definition of Morphism on Petri Nets. Lecture Notes in Computer Science Vol. 166: STACS 84, Symp. of Theor. Aspects of Computer Science, Paris — Berlin: Springer-Verlag, S. 140–150 (1984)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Einar Smith
    • 1
    • 2
  1. 1.GMD-F1PSchloß BirlinghovenSt. Augustin
  2. 2.University of KoblenzKoblenzGermany

Personalised recommendations