Extremal throughputs in free-choice nets

Abstract : 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''.
Document type :
Journal articles
Liste complète des métadonnées

Cited literature [12 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00164817
Contributor : Jean Mairesse <>
Submitted on : Friday, July 27, 2007 - 4:27:28 PM
Last modification on : Friday, January 4, 2019 - 5:32:57 PM
Document(s) archivé(s) le : Thursday, April 8, 2010 - 11:50:56 PM

Files

freechoice-hal.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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

Share

Metrics

Record views

404

Files downloads

180