Skip to main content
SpringerLink
Log in

Petri nets, event structures and domains

  • Conference paper
  • First Online:
Book cover Semantics of Concurrent Computation

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 70))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Best, E. (1977) A Theorem on the Characteristics of Non-Sequential Processes. Computing Laboratory Technical Report No. 116, University of Newcastle-upon-Tyne.

    Google Scholar 

  2. Kahn, G. and Plotkin, G.D. (1978) Domaines Concrets. IRIA Rapport de Recherche No. 336, IRIA, France.

    Google Scholar 

  3. Markowsky, G. and Rosen, B. (1976) Bases for Chain-Complete Posets. IBM J. Res. and Develop., Vol. 20, 138–147.

    Google Scholar 

  4. Mazurkiewicz, A. (1977) Concurrent Program Schemes and their Interpretations, DAIMI PB-78 (Aarhus Univ. Publ.), July 1977.

    Google Scholar 

  5. Petri, C.A. (1976) Nichtsequentielle Prozesse Arbeitsberichte des IMMD, Bd. 9, Heft. 8, p.57ff. Universität Erlangen-Nürnberg. Also: Non-Sequential Processes, Translation by P. Krause and J. Low. Internal Report GMD-ISF-77-05. Bonn (1977).

    Google Scholar 

  6. Petri, C.A. (1977) General Net Theory. Communication Disciplines. Proc. Joint IBM Univ. of Newcastle Seminar 1976 (ed. B. Shaw) University of Newcastle-upon-Tyne.

    Google Scholar 

  7. Scott, D. (1970) Outline of a Mathematical Theory of Computation. Proc. of 4th Ann. Princeton Conf. on Information Sciences and Systems, pp. 169–176.

    Google Scholar 

  8. Scott, D. (1971) The lattice of flow diagrams. Symposium on Semantics of Algorithmic Languages (ed. E. Engeler) Lecture Notes in Mathematics, Vol. 188, Springer-Verlag, New York, pp. 311–366.

    Google Scholar 

  9. Scott, D. (1976) Data Types as Lattices. SIAM J. Comput., Vol. 5, No. 3, 522–587.

    Article  Google Scholar 

  10. Stoy, J.E. (1978) Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. Cambridge: MIT Press.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University of Aarhus, 8000, Aarhus C, Denmark

    Mogens Nielsen

  2. Dept. of Artificial Intelligence, University of Edinburgh, Hope Park Square, Meadow Lane, EH8 9NW, Edinburgh, Scotland

    Gordon Plotkin & Glynn Winskel

Authors
  1. Mogens Nielsen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gordon Plotkin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Glynn Winskel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gilles Kahn

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nielsen, M., Plotkin, G., Winskel, G. (1979). Petri nets, event structures and domains. In: Kahn, G. (eds) Semantics of Concurrent Computation. Lecture Notes in Computer Science, vol 70. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022474

Download citation

  • DOI: https://doi.org/10.1007/BFb0022474

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09511-8

  • Online ISBN: 978-3-540-35163-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation