Reduction and expansion of live and safe marked graphs

In this paper it is proved that certain parallel, series, and circuit reductions and expansions on a marked graph do not change the number of its equivalence classes of live and safe markings. The reductions are aseful for the analysis of marked graphs, and the expansions can be used for synthesizing live and safe marked graphs.