Extremal Throughputs in Free-Choice Nets

被引：0
|
作者：
Anne Bouillard
Bruno Gaujal
Jean Mairesse
机构：
[1] Université Claude Bernard Lyon 1,LIP UMR CNRS, ENS Lyon, INRIA
[2] École Normale Supérieure de Lyon,undefined
[3] Lab. ID-MAG,undefined
[4] INRIA-CNRS-UJF-INPG 51,undefined
[5] CNRS-Université Paris 7,undefined
[6] LIAFA,undefined
[7] Case 7014,undefined
来源：
Discrete Event Dynamic Systems | 2006年 / 16卷
关键词：
Free-choice Petri nets; Timed and routed nets; Throughput;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We give a method to compute the throughput in a timed live and bounded free-choice Petri net under a total allocation (i.e. a 0–1 routing). We also characterize and compute the conflict-solving policies that achieve the smallest throughput in the special case of a 1-bounded net. They do not correspond to total allocations, but still have a small period.
引用
收藏
页码：327 / 352
页数：25
相关论文
共 50 条
12345