Extremal throughputs in free-choice nets

Anne Bouillard (1) , Bruno Gaujal (2) , Jean Mairesse (3)

1 LIP - Laboratoire de l'Informatique du Parallélisme
2 MESCAL - Middleware efficiently scalable
3 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications

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''.

Mots clés: Free-choice Petri nets; timed and routed nets; throughput.; throughput

Domaines: Mathématique discrète [cs.DM]

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⟩