In: Proceeding of the 16th International Conference on Application and Theory of Petri Nets, Turin, June 1995., pages 25-44. 1995.
Abstract: For several years, research has been done to establish relations between the liveness of a net and the structure of the underlying graph. This work has resulted in the proposition of polynomial algorithms to check liveness for particular classes of nets. In this paper, we present Extended Non Self-Controlling Nets, a class of nets that includes Extended Free-Choice Nets and Non Self-Controlling Nets. We develop some properties of this new class of nets and we propose polynomial algorithms whose application domain is wider than the domain of the previous algorithms.
Back to the Petri Nets Bibliography