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 smallest throughput in the special case of a 1-bounded net. It does not correspond to a total allocation, but "almost".
Type de document :
Communication dans un congrès
Springer. 26th International Conference on Application and Theory of Petri Nets 2005, 2005, Miami, Florida, United States. 3536, pp.108-127, 2004, Lecture Notes in Computer Science
Liste complète des métadonnées

https://hal.inria.fr/inria-00099917
Contributeur : Jean Mairesse <>
Soumis le : vendredi 27 juillet 2007 - 11:49:21
Dernière modification le : jeudi 15 novembre 2018 - 20:26:56
Document(s) archivé(s) le : lundi 5 avril 2010 - 23:10:49

Fichiers

Identifiants

  • HAL Id : inria-00099917, version 1

Collections

Citation

Anne Bouillard, Bruno Gaujal, Jean Mairesse. Extremal throughputs in free-choice nets. Springer. 26th International Conference on Application and Theory of Petri Nets 2005, 2005, Miami, Florida, United States. 3536, pp.108-127, 2004, Lecture Notes in Computer Science. 〈inria-00099917〉

Partager

Métriques

Consultations de la notice

199

Téléchargements de fichiers

64