In: Proceedings of the 12th International Conference on Application and Theory of Petri Nets, 1991, Gjern, Denmark, pages 102-121. June 1991.
Abstract: The application of the ``stubborn set'' reduced reachability graph generation method for speeding up the analysis of coloured Petri nets is discussed. The stubborn set method reduces the number of markings which are generated during reachability analysis. The basic stubborn set method preserves all dead markings and reveals whether the net may perform an infinite transition sequence. The stubborn sets of coloured Petri nets are defined. It is shown that the basic stubborn set method can be used simultaneously with the equivalent marking method by Jensen. The combination of the two methods leads to a better reduction than either method alone.
Keywords: stubborn set (of) coloured net; reduced reachability graph generation; place/transiton net; dead marking; infinite transition sequence; equivalent marking method (by Jensen); (system) verification; analysis (of) net behaviour.