M. V. Iordache and P. J. Antsaklis
In Applications and Theory of Petri Nets 2001, Lecture Notes in Computer Science vol. 2075, pp.184-203, June 2001.
Abstract -- This paper presents new results concerned with liveness, liveness of a subset of transitions and deadlock in Petri nets. Liveness is seen as a particular case of what we call T-liveness: all transitions in the set T are live. The first results characterize the relation between supervisors enforcing liveness and T-liveness with supervisors preventing deadlock. Then we introduce a class of Petri net subnets allowing us to extend two well known results. Specifically we generalize the result relating deadlock to siphons and the extension to asymmetric choice Petri nets of the Commoner's Theorem. We conclude by considering how the theoretical results of this paper can be used for deadlock prevention, least restrictive deadlock prevention and least restrictive T-liveness enforcement.
Slides available: [pdf, 117k]