ABSTRACT
As systems evolve and increase in complexity, it can be difficult to maintain and verify some properties modelled by Petri nets. Reduction rules and its equivalent synthesis rules can be used for the transformation of the evolving Petri nets. It is preferrable that these transformation methods preserve properties as they evolve. This paper prove that well-handledness can be strongly preserved after applying some reduction rules to an arbitrary Petri net. Additionaly, this result provide a way to partially verify well-handledness in Petri nets.
