A polynomial-time algorithm to decide liveness of bounded free choice nets☆

https://doi.org/10.1016/0304-3975(92)90299-UGet rights and content
Under an Elsevier user license
open archive

Abstract

Lautenbach (1987) described an interesting method for the linear algebraic calculation of deadlocks and traps. The method is here proved anew and its power clarified. This allows us to propose a polynomial time algorithm to decide liveness for bounded free choice nets, thus proving an enlarged version of a conjecture raised by Jones (1977)

Cited by (0)

☆

This work was partially supported by the Esprit Basic Research Action DEMON

∗∗

A large part of this work was done while this author was a member of the Dpto. Ingeniería Eléctrica e Informática, Zaragoza, Spain.

Copyright © 1992 Published by Elsevier B.V.