For the most recent entries see the Petri Nets Newsletter.

Minimal Deadlocks in Free Choice Nets.

Esparza, J.; Best, E.; Silva, M.

Universidad de Zaragoza, departamento de ingenieria electrica e informatica, Research Report 89-09, May 1989.

Also as: 89: Hildesheimer Informatik-Berichte 1. Universität Hildesheim (Germany), Institut für Informatik, July 1989.

Abstract: The purpose of this note is to present a a simple characterisation of minimal deadlocks for Free Choice nets. This simplified characterisation is used to obtain two results: the first is an algorithm that constructs minimal deadlocks in (strongly connected) Free Choice nets; the second is the existence of a close relationship between minimal and strongly connected deadlocks in the same subclass.

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography