For the most recent entries see the Petri Nets Newsletter.

A Reduction Theory for Coloured Nets.

Haddad, S.

In: Rozenberg, G.: Lecture Notes in Computer Science, Vol. 424; Advances in Petri Nets 1989, pages 209-235. Berlin, Germany: Springer-Verlag, 1990.

Abstract: This paper presents the generalization to the coloured nets of the most efficient reductions defined by Berthelot. First, a generalization methodology is given that is independent from reduction one wants to generalize. Then based on that methodology, the author defines extensions of the implicit place transformation and the pre and post agglomeration of transitions. For each reduction it is proved that the reduced net has exatcly the same properties as the origianl net. Finally the author completely reduces an improved model of the data base management with multiple copies, thus showing ist correctness.

Keywords: reduction theory (for) coloured nets.

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

Back to the Petri Nets Bibliography