Blocking a transition in a Free Choice net and what it tells about its throughput

Bruno Gaujal (1) , Stefan Haar (2) , Jean Mairesse (3)

1 LIP - Laboratoire de l'Informatique du Parallélisme
2 SIGMA2 - Signal, models, algorithms
3 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications

In a live and bounded Free Choice Petri net, pick a non-conflicting transition. Then there exists a unique reachable marking in which no transition is enabled except the selected one. For a routed live and bounded Free Choice net, this property is true for any transition of the net. Consider now a live and bounded stochastic routed Free Choice net, and assume that the routings and the firing times are independent and identically distributed. Using the above results, we prove the existence of asymptotic firing throughputs for all transitions in the net. Furthermore the vector of the throughputs at the different transitions is explicitly computable up to a multiplicative constant.

Mots clés: monotone-separable framework; Petri net; free-choice net; routed Petri net; stochastic Petri net; stability; monotone-separable framework.

Domaines: Autre [cs.OH]

Bruno Gaujal, Stefan Haar, Jean Mairesse. Blocking a transition in a Free Choice net and what it tells about its throughput. Journal of Computer and System Sciences, 2003, 66 (3), pp.515-548. ⟨10.1016/S0022-0000(03)00039-4⟩. ⟨inria-00072394v2⟩