Skip to main content
Article thumbnail
Location of Repository

Extremal throughputs in free-choice nets

By Anne Bouillard, Bruno Gaujal and Jean Mairesse

Abstract

Journal version: "Extremal throughput in free-choice nets", Discrete Event Dynamic Systems, vol. 16, n. 3, p. 327-352, 2006.International audienceWe 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"

Topics: throughput maximization, Free-choice Petri net, total allocation, routing policy, throughput maximization., [INFO.INFO-OH] Computer Science [cs]/Other [cs.OH]
Publisher: HAL CCSD
Year: 2005
OAI identifier: oai:HAL:inria-00099917v1
Provided by: Hal-Diderot
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • https://hal.inria.fr/inria-000... (external link)
  • https://hal.inria.fr/inria-000... (external link)
  • https://hal.inria.fr/inria-000... (external link)
  • https://hal.inria.fr/inria-000... (external link)
  • https://hal.inria.fr/inria-000... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.