Refinement of coloured petri nets

  • Eike Best
  • Thomas Thielke
Technical Contributions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1279)


In this paper we describe and apply a multirelational approach for performing linear-algebraic refinement of coloured Petri nets.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    E. Best, R. Devillers, J. Esparza: General Refinement and Recursion Operators for the Petri Box Calculus. Proc. STAGS-93, Springer-Verlag, LNCS Vol.665 (P. Enjalbert, A. Finkel, K.W. Wagner, eds), 130–140 (1993).Google Scholar
  2. 2.
    E. Best, Th. Thielke: Coloured Nets with Curry: a multirelation-based linear algebra for high-level Petri nets. Petri Net Newsletters No. 50, 27–44 (April 1996). Slightly abrigded version: Orthogonal Transformations for Coloured Petri Nets. To appear in Proc. of Petri Net Conference'97 (Toulouse), Springer-Verlag, LNCS (P. Azéma, G. Balbo, eds) (1997).Google Scholar
  3. 3.
    R. Devillers: S-invariant Analysis of General Recursive Petri Boxes. Acta Informatica 32, 313–345 (1995).Google Scholar
  4. 4.
    K. Jensen: Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use. Volume 1. EATCS Monographs on Theoretical Computer Science, Springer-Verlag (1992).Google Scholar
  5. 5.
    W. Reisig: Petri Nets. An Introduction. EATCS Monographs on Theoretical Computer Science Vol. 4, Springer-Verlag (1985).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Eike Best
    • 1
  • Thomas Thielke
    • 2
  1. 1.Carl-von-Ossietzky-Universität OldenburgOldenburg
  2. 2.Universität HildesheimHildesheim

Personalised recommendations