Advertisement

A strong part of concurrency

  • Wolfgang Reisig
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 266)

Abstract

Concurrency is the fundamental relation that structures occurrence nets. We shall discriminate pairs of concurrent elements that "certainly coexist" due to the structure of the net. This relation of "strong concurrency" sheds new light to notions such as conflict, confusion, fairness, and priority.

Key Words

concurrency interleaving sequences conflict confusion fairness priority 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Best 84]
    E. Best: Fairness and Conspiracies. Information Processing Letters 18, 215–220 (1984)Google Scholar
  2. [Best 86]
    E. Best: Interleaving and Partial Orders in Concurrency: A Formal Comparison, in: M. Wirsing (ed) Proc. of the 3rd Working Conference on the Formal Descr. of Programming Concepts. North Holland Publ. Comp. (1986)Google Scholar
  3. [Best, Devillers 85]
    E. Best, R. Devillers: Concurrent Behaviour: Sequences, Processes and Programming Languages. GMD-Studien Nr. 99 (1985)Google Scholar
  4. [Best, Fernandez 86]
    E. Best, C. Fernandez: Notations and Terminology of Petri Net Theory. Arbeitspapiere der GMD 1975 (1986). Reprinted in Petri Net Newsletter 23Google Scholar
  5. [Carstensen, Valk 84]
    H. Carstensen, R. Valk: Infinite Behaviour and Fairness in Petri Nets. Advances in Petri Nets 1984, Lecture Notes in Computer Science 188, 83–100 (1984)Google Scholar
  6. [Genrich, Lautenbach, Thiagarajan 80]
    H.J. Genrich, K. Lautenbach, P.S. Thiagarajan: Elements of General Net Theory. in: W. Brauer (ed): Net Theory and Applications, LNCS 84, Springer-VerlagGoogle Scholar
  7. [Goltz, Reisig 83]
    U. Goltz, W. Reisig: The Non-sequential Behaviour of Petri Nets. Information and Control 57, Nos 2–3, 125–147Google Scholar
  8. [Mazurkiewicz 86]
    A. Mazurkiewicz: Complete Processes and Inevitability. Internal Report 86-06, Dept. of Computer Science University of Leiden, The NetherlandsGoogle Scholar
  9. [Nielsen, Plotkin, Winskel 81]
    M. Nielsen, G. Plotkin, G. Winskel: Petri Nets, Event Structures, and Domains Part I. Theoretical Computer Science 13, 85–108 (1981)CrossRefGoogle Scholar
  10. [Petri 75]
    C.A. Petri: Interpretations of Net Theory. GMD internal report 75-07 (1975). Second, revised version 1976Google Scholar
  11. [Reisig 85]
    W. Reisig: Petri Nets — an Introduction. Springer-Verlag (1985)Google Scholar
  12. [Reisig 86]
    W. Reisig: On the Semantics of Petri Nets. in: Neuhold, Chroust (eds), Formal Models in Programming. North Holland Publ. Comp. (1987)Google Scholar
  13. [Rozenberg, Thiagarajan 86]
    G. Rozenberg, P.S. Thiagarajan: Petri Nets: Basic Notions, Structure, Behaviour. Lecture Notes in Computer Science 224, Springer-Verlag (1986)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Wolfgang Reisig
    • 1
  1. 1.Gesellschaft für Mathematik und DatenverarbeitungSankt Augustin

Personalised recommendations