A reduction theory for coloured nets

Abstract

This paper presents the generalization to the coloured nets of the most efficient reductions defined by Berthelot for Petri nets. First, a generalization methodology is given that is independent from the reduction one wants to generalize. Then based on that methodology, we define extensions of the implicit place transformation and the pre and post agglomeration of transitions. For each reduction we prove that the reduced net has exactly the same properties as the original net. Finally we completely reduce an improved model of the data base management with multiple copies, thus showing its correctness.