For the most recent entries see the Petri Nets Newsletter.

Extremal Throughputs in Free-Choice Nets.

Bouillard, Anne; Gaujal, Bruno; Mairesse, Jean

In: Discrete Event Dynamic Systems, Volume 16, 3, 2006, pages 327-352. September 2006. URL:

Abstract: We give a method to compute the throughput in a timed live and bounded free-choice Petri net under a total allocation (i.e. a 0-1 routing). We also characterize and compute the conflict-solving policies that achieve the smallest throughput in the special case of a 1-bounded net. They do not correspond to total allocations, but still have a small period.

Keywords: Free-choice Petri nets; Timed and routed nets; Throughput.

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

Back to the Petri Nets Bibliography