LRI--Rapport. Laboratoire de Recherche en Informatique, Universite de Paris-Sud, Centre d'Orsay, France, 1990.
Abstract: The author considers Place/Transition-systems (P/T-systems) which are lambda-free labeled. They are called normalized if their arcs are not valuated and their initial and final markings are subsets of the set of places. The author proves that for each general P/T-system there exists a normalized P/T-system having exactly the same concurrent behaviour (in the partial word semantics). The same (constructive) transformation also preserves finitary and infinitary sequential behaviour and the concurrent behaviour (in the step semantics). This allows to restrict to normalized P/T-systems when working on net behaviour without loss of generality.
Keywords: normalisation (of) place/transtion system(s); net behaviour preservation; lambda-free labeled place/transition system; concurrent, sequential behaviour; partial word semantics; step semantics.