In: Proc. of the 11th Romanian Symposium on Computer Science ROSYCS'98, Iasi (Romania). May 1998. Available at http://www.infoiasi.ro/~fltiplea/.
Also in: Scientific Annals of the Alexandru Ioan Cuza University of Iasi, Co. Sci Section, Tome VIII, pages 151-161. 1998.
Abstract: A Petri net is normalized if both the weight function and the initial and final markings (if any) take values in 0,1. E. Pelz showed that any Petri net is equivalent, via concurrent (process) behaviour, with a normalized one. Moreover, an algorithm to normalize a Petri net has been given. In the paper it is shown that the Pelz's algorithm can be simplified. As a result, in some cases the complexity (in terms of places, transitions and arcs of the yielded net) is reduced almost by half, whereas in other cases it is better to combine some parts of the Pelz's algorithm with the new version. Moreover, the proof of correctness uses elementary techniques comparing with the Pelz's proof which uses techniques of graph colouring.