In: Theoretical Informatics and Applications 26 1, pages 19-44. 1992.
Abstract: In this paper we consider place/transition-systems (abbreviated as P/T-systems) which are l-free labeled. They are called normalized if their arcs are not weighted and their initial and final markings are subsets of the set of places. We prove 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 behaviours. This allows us to consider only normalized P/T-systems when working on net behaviour without loss of generality.