Finite automorphism groups of Petri Nets

The notion of isomorphism and automorphism for labeled transition systems are defined, in particular monotonic isomorphism and automorphism – for well structured transition systems. It is shown, that any automorphism corresponds to a sertain bisimulation. It is prowed, that a group of monotonic automorphisms in any Petri Nets is finite.