Abstract
In this paper we describe and apply a multirelational approach for performing linear-algebraic refinement of coloured Petri nets.
Preview
Unable to display preview. Download preview PDF.
References
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).
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).
R. Devillers: S-invariant Analysis of General Recursive Petri Boxes. Acta Informatica 32, 313–345 (1995).
K. Jensen: Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use. Volume 1. EATCS Monographs on Theoretical Computer Science, Springer-Verlag (1992).
W. Reisig: Petri Nets. An Introduction. EATCS Monographs on Theoretical Computer Science Vol. 4, Springer-Verlag (1985).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Best, E., Thielke, T. (1997). Refinement of coloured petri nets. In: Chlebus, B.S., Czaja, L. (eds) Fundamentals of Computation Theory. FCT 1997. Lecture Notes in Computer Science, vol 1279. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036175
Download citation
DOI: https://doi.org/10.1007/BFb0036175
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63386-0
Online ISBN: 978-3-540-69529-5
eBook Packages: Springer Book Archive