Petri nets and algebraic calculi of processes

  • Cérard Boudol
  • Cérard Roucairol
  • Robert de Simone
Conference paper

DOI: 10.1007/BFb0023995

Part of the Lecture Notes in Computer Science book series (LNCS, volume 182)
Cite this paper as:
Boudol C., Roucairol C., de Simone R. (1985) 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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1985

Authors and Affiliations

  • Cérard Boudol
    • 1
  • Cérard Roucairol
    • 2
  • Robert de Simone
    • 3
  1. 1.INRIA, Sophia AntipolisValbonneFrance
  2. 2.LRI, Université Paris SudOrsayFrance
  3. 3.CMA-ENSMP, Sophia AntipolisValbonneFrance

Personalised recommendations