In: Proceedings of the 12th International Conference on Application and Theory of Petri Nets, 1991, Gjern, Denmark, pages 42-61. June 1991.
Also in: Rozenberg, G.: Lecture Notes in Computer Science, Vol. 674; Advances in Petri Nets 1993, pages 26-50. Springer-Verlag, 1993.
Also in: Acta Informatica, Vol. 32, No. 3, pages 189-207. 1995.
Abstract: The authors investigate the property of self-stabilizing in bounded Petri nets. They give characterizations for both self-stabilizing bounded ordinary Petri nets (i.e. Petri nets without multiple arcs) and self-stabilizing bounded general Petri nets (i.e. Petri nets with multiple arcs). These characterizations allow to determine the complexity of deciding self-stablilization for each of these classes. In particular, the authors show the self-stablilization problem to be PTIME-complete for bounded ordinary Petri nets and PSPACE-complete for bounded general Petri nets.
Keywords: bounded self-stablilizing net; general net (with) multiple arcs; p-time-completeness, p-space-completeness, (of) self-stablilization problem (of) bounded net(s).