Acta Informatica

, Volume 37, Issue 11–12, pp 781–829 | Cite as

Recursion and Petri nets

  • Eike Best
  • Raymond Devillers
  • Maciej Koutny
Original articles


This paper shows how to define Petri nets through recursive equations. It specifically addresses this problem within the context of the {it box algebra}, a model of concurrent computation which combines Petri nets and standard process algebras. The paper presents a detailed investigation of the solvability of recursive equations on nets in what is arguably the most general setting. For it allows an infinite number of possibly unguarded equations, each equation possibly involving infinitely many recursion variables. The main result is that by using a suitable partially ordered domain of nets, it is always possible to solve a system of equations by constructing the limit of a chain of successive approximations.


General Setting Infinite Number Successive Approximation Standard Process Recursive Equation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Eike Best
    • 1
  • Raymond Devillers
    • 2
  • Maciej Koutny
    • 3
  1. 1.Fachbereich Informatik, Carl von Ossietzky Universität, 26111 Oldenburg, Germany DE
  2. 2.Dépt. d'Informatique, Université Libre de Bruxelles, 1050 Bruxelles, Belgium BE
  3. 3.Dept. of Computer Science, University of Newcastle, Newcastle upon Tyne NE1 7RU, U.K. GB

Personalised recommendations