For the most recent entries see the Petri Nets Newsletter.

On the Model of computation of Place/Transition Petri Nets.

Meseguer, Josú; Montanari, Ugo

In: Valette, R.: Lecture Notes in Computer Science, Vol. 815; Application and Theory of Petri Nets 1994, Proceedings 15th International Conference, Zaragoza, Spain, pages 16-38. Springer-Verlag, 1994.

Abstract: In the last few years, the semantics of Petri nets has been investigated in several different ways. Apart from the classicial ``token game'', one can model the behaviour of Petri nets via non-sequential processes, via unfolding constructions, which provide formal relationships between nets und domains, and via algebraic models, which view Petri nets as essentially algebraic theories whose models are monoidal catagories. In this paper we show that these three points of view can be reconciled. More precisely, we introduce the new notion of decorated processes of Petri nets and we show that they induce on nets the same semantics as that of unfolding. In addition, we prove that the decorated processes of a net N can be axiomatized as the arrows of a symmetric monoidal category which, therefore, provides the aforesaid unification


Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography