Orthogonal Transformations for Coloured Petri Nets

In this paper we describe a multirelational approach for performing linear algebraic manipulations of (coloured) Petri nets. In particular, we show how orthogonal transformations can be used in order to describe the net folding and unfolding operations.

[1]  Hartmann J. Genrich,et al.  Predicate/Transition Nets , 1986, Advances in Petri Nets.

[2]  Kurt Jensen,et al.  Coloured Petri nets (2nd ed.): basic concepts, analysis methods and practical use: volume 1 , 1996 .

[3]  Kurt Jensen,et al.  Coloured Petri Nets , 1997, Monographs in Theoretical Computer Science An EATCS Series.

[4]  Jacques Vautherin,et al.  Parallel systems specitications with coloured Petri nets and algebraic specifications , 1986, European Workshop on Applications and Theory of Petri Nets.

[5]  Wolfgang Reisig,et al.  The Semantics of a Net is a Net , 1987 .

[6]  Wolfgang Reisig.  Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.

[7]  Hanna Klaudel,et al.  A Class of Composable High Level Petri Nets with an Application to the Semantics of B(PN)2 , 1995, Application and Theory of Petri Nets.

[8]  Wolfgang Reisig,et al.  Petri Nets and Algebraic Specifications , 1991, Theor. Comput. Sci..

[9]  Grzegorz Rozenberg,et al.  Concurrency and Nets , 1987, Springer Berlin Heidelberg.

[10]  Eike Best,et al.  Semantics of sequential and parallel programs , 1996, Prentice Hall International series in computer science.