Conclusion

  • Eike Best
  • Raymond Devillers
  • Maciej Koutny
Part of the Monographs in Theoretical Computer Science An EATCS Series book series (EATCS)

Abstract

In the introduction of this book, we had indicated that we aimed at forging as tight and strong links between process algebras and Petri nets as possible. In retrospect, it is possible to say that we have achieved this aim both at the structural and at the behavioural levels. Moreover, we have carried out this investigation not only for a specific process algebra, but rather in a generic way, for the box algebra. The latter encompasses an infinity of concrete process algebras, of which the existing ones can be viewed as suitably adapted derivatives or instances. It is also worth mentioning that we have strived to allow infinity in the definitions and formulations of the results wherever it was possible; in particular, we considered operators with infinitely many arguments.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Eike Best
    • 1
  • Raymond Devillers
    • 2
  • Maciej Koutny
    • 3
  1. 1.Fachbereich InformatikCarl von Ossietzky Universität OldenburgOldenburgGermany
  2. 2.Faculté des Sciences, Laboratoire d’Informatique ThéoriqueUniversité Libre de BruxellesBruxellesBelgium
  3. 3.Department of Computing ScienceUniversity of NewcastleNewcastle upon TyneUK

Personalised recommendations