For the most recent entries see the Petri Nets Newsletter.

An Efficient Polynomial-Time Algorithm to Decide Liveness and Boundedness of Free Choice Nets.

Kemper, Peter; Bause, Falko

In: Forschungsbericht Nr. 402 des Fachbereichs Informatik der Universität Dortmund (Germany). 1991.

Also in: Jensen, K.: Lecture Notes in Computer Science, Vol. 616; 13th International Conference on Application and Theory of Petri Nets 1992, Sheffield, UK, pages 263-278. Springer-Verlag, June 1992.

Abstract: J. Esparza presented an interesting characterization of structurally live and structurally bounded Free-Choice Nets (LBFC-Nets). Exploiting this characterization in combination with new results and refined algorithms the authors formulate an O(|P||T||F|) algorithm deciding whether a Free-Choice Net is a LBFC-Net or not. Furthermore the algorithm contains a simple and efficient test to ensure that the initial marking of a LBFC-Net is live.The test is based on a simplified characterization of liveness for LBFC-Nets.

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

Back to the Petri Nets Bibliography