For the most recent entries see the Petri Nets Newsletter.

A Polynomial-Time Algorithm to Decide Liveness of Bounded Free Choice Nets.

Esparza, J.; Silva, M.

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

Also as: 90: Hildesheimer Informatik-Berichte 12, pages 1-25 pp.. Universität Hildesheim (Germany), Institut für Informatik, December 1990.

Also in: Theoretical Computer Science, Vol. 102. Elsevier, 1992.

Abstract: K. Lautenbach (1987) described an interesting method for the linear algebraic calculation of deadlocks and traps. This method is here proved anew and its power is clarified. This allows the authors to propose a polynomial time algorithm to decide liveness for Bounded Free Choice Nets, thus proving an enlarged version of a conjecture raised by N. Jones et al.

Keywords: polynomial-time algorithm (to decide) liveness (of) bounded free choice net(s).

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

Back to the Petri Nets Bibliography