Skip to main content
SpringerLink
Log in

Petri nets and algebraic calculi of processes

  • Conference paper
  • First Online:
STACS 85 (STACS 1985)

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

Included in the following conference series:

Abstract

We show that, as transition systems, Petri nets may be expressed by terms of a calculus of processes which is a variant of Milner's SCCS. We then prove that the class of labelled nets forms a subcalculus, thus an algebra, with juxtaposition, adding condition and labelling as primitive operations.

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. D. Austry, G. Boudol: "Algèbre de processus et synchronisation", Theoret. Comput. Sci. 30 (1984)

    Google Scholar 

  2. W. Brauer (editor): "Advanced course on general net theory of processes and systems", Hamburg 1979. Lecture Notes in Comput. Sci. 84 (Springer, Berlin, 1980)

    Google Scholar 

  3. G.W. Brams: "Réseaux de Petri: théorie et pratique", (Masson, Paris, 1983)

    Google Scholar 

  4. R.H. Campbell, P.E. Lauer: "Formal semantics for a class of high-level primitives for coordinating concurrent processes". Acta Informatica 5 (1975), 247–332

    Google Scholar 

  5. U. Goltz, A. Mycroft: "On the relationship of CCS and Petri Nets", ICALP 84, Lecture Notes in Comput. Sci. 172 (Springer, Berlin, 1984), 196–208

    Google Scholar 

  6. V.E. Kotov: "An algebra for parallelism based on Petri nets", MFCS 79, Lecture Notes in Comput. Sci. 64 (Springer, Berlin, 1979), 39–55

    Google Scholar 

  7. R. Milner: "Flowgraphs and flow algebras", JACM 26 (1979), 794–818

    Google Scholar 

  8. R. Milner: "A calculus of communicating systems", Lecture Notes in Comput. Sci., 92 (Springer, Berlin, 1980)

    Google Scholar 

  9. R. Milner: "On relating synchrony and asynchrony", Tech. Rept. CSR-75-80, Comput. Sci. Dept., Edinburgh Univ. 1980

    Google Scholar 

  10. R. Milner: "Four combinators for concurrency", 2nd ACM Symp. on Principles of Distributed Computing, Ottawa (1982)

    Google Scholar 

  11. R. Milner: "Calculi for synchrony and asynchrony", Theoret. Comput. Sci. 25 (1983), 267–310

    Google Scholar 

  12. J.L. Peterson: "Petri nets", Comput. Surveys 9 (1977), 223–252

    Google Scholar 

  13. G. Rozenberg, R. Verraedt: "Subset languages of Petri nets", Part I, Theoret. Comput. Sci. 26 (1983), 301–326

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. INRIA, Sophia Antipolis, 06565, Valbonne, France

    Cérard Boudol

  2. LRI, Université Paris Sud, 91405, Orsay, France

    Cérard Roucairol

  3. CMA-ENSMP, Sophia Antipolis, 06565, Valbonne, France

    Robert de Simone

Authors
  1. Cérard Boudol
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cérard Roucairol
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Robert de Simone
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

K. Mehlhorn

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Boudol, C., Roucairol, C., de Simone, R. (1984). Petri nets and algebraic calculi of processes. In: Mehlhorn, K. (eds) STACS 85. STACS 1985. Lecture Notes in Computer Science, vol 182. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023995

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13912-6

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation