Extremal throughputs in free-choice nets
Résumé
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''.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...