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

Abstract : 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.
Type de document :
Article dans une revue
Journal of Computer and System Sciences, Elsevier, 2003, 66 (3), pp.515-548. 〈10.1016/S0022-0000(03)00039-4〉
Liste complète des métadonnées

Littérature citée [28 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00072394
Contributeur : Jean Mairesse <>
Soumis le : lundi 30 juillet 2007 - 12:23:22
Dernière modification le : mercredi 16 mai 2018 - 11:23:05
Document(s) archivé(s) le : mardi 21 septembre 2010 - 12:58:11

Fichiers

blocking-hal.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

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, Elsevier, 2003, 66 (3), pp.515-548. 〈10.1016/S0022-0000(03)00039-4〉. 〈inria-00072394v2〉

Partager

Métriques

Consultations de la notice

299

Téléchargements de fichiers

88