Extremal throughputs in free-choice nets - Archive ouverte HAL Access content directly
Journal Articles Discrete Event Dynamic Systems Year : 2006

Extremal throughputs in free-choice nets


We give a method to compute the throughput in a timed live and bounded free choice Petri net under a total allocation. We also characterize the conflict-solving policies that achieve the largest throughput in the special case of a 1-bounded net. It does not correspond to a total allocation, but ``almost''.
Fichier principal
Vignette du fichier
freechoice-hal.pdf (315.08 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00164817 , version 1 (27-07-2007)



Anne Bouillard, Bruno Gaujal, Jean Mairesse. Extremal throughputs in free-choice nets. Discrete Event Dynamic Systems, 2006, 16 (3), pp.327-352. ⟨10.1007/s10626-006-9326-y⟩. ⟨hal-00164817⟩
216 View
177 Download



Gmail Facebook Twitter LinkedIn More