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

Author: Peter Kemper, Falko Bause

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.  This test is based on a
simplified characterization of liveness for LBFC-Nets.


Published in:
	Application and Theory of Petri Nets 1992
	13th int. Conf. Sheffield, UK
	Springer Lecture Notes in Computer Science 616