Token-Free Petri Nets
In the paper a modification of classical Petri nets is defined. The fundamental notions of nets, as places, transitions, and firing rules are retained. In this way the composition properties of classical nets as well as their full expressive power is preserved. However, while preserving basic notions of Petri nets theory, the presented modification offers much more freedom in defining data types and the way of place contents transformations. It turns out that such a modification leads to a simplification of the net description (neither tokens nor arrows are necessary anymore) and yet strengthening its expressive power.
Unable to display preview. Download preview PDF.
- 1.Diekert, V., Rozenberg, G.: Book of Traces. World Scientific Pub. Co, Singapore (1995)Google Scholar
- 2.Mazurkiewicz, A.: Semantics of Concurrent Systems: A Modular Fixed Point Trace Approach, Instituut voor Toegepaste Wiskunde en Informatica, Rijksuniversiteit Leiden, TR-84-19 (1984)Google Scholar
- 3.Petri, C.A.: Concepts of Net Theory. In: Proc. of MFCS 1973, High Tatras, Math. Institute of Slovak Academy of Sciences, pp. 137–146 (1973)Google Scholar
- 4.Reisig, W.: Petri Nets. In: EATCS Monographs on Theoretical Computer Science, Springer, Heidelberg (1985)Google Scholar
- 5.Shields, M.W.: Non-sequential behaviour, part I. Int. Report CSR-120-82, Dept. of Computer Science, University of Edinburgh (1979)Google Scholar