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 条
  • [1] Extremal throughputs in free-choice nets
    Bouillard, Anne
    Gaujal, Bruno
    Mairesse, Jean
    DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS, 2006, 16 (03): : 327 - 352
  • [2] Extremal throughputs in free-choice nets
    Bouillard, A
    Gaujal, B
    Mairesse, J
    APPLICATIONS AND THEORY OF PETRI NETS 2005, PROCEEDINGS, 2005, 3536 : 108 - 127
  • [3] Free-choice Petri nets - An algebraic approach
    Baccelli, F
    Foss, S
    Gaujal, B
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1996, 41 (12) : 1751 - 1778
  • [4] Free-choice Nets with Home Clusters are Lucent
    van der Aalst, Wil M. P.
    FUNDAMENTA INFORMATICAE, 2021, 181 (04) : 273 - 302
  • [5] On probabilistic diagnosis for free-choice Petri Nets
    Flochova, Jana
    Boel, Rene K.
    Jiroveanu, George
    2007 AMERICAN CONTROL CONFERENCE, VOLS 1-13, 2007, : 5541 - +
  • [6] Optimal sensor choice for observability in Free-choice Petri Nets
    Aguirre-Salas, L
    Begovich, O
    Ramirez-Treviño, A
    PROCEEDINGS OF THE 2001 IEEE INTERNATIONAL SYMPOSIUM ON INTELLIGENT CONTROL (ISIC'01), 2001, : 270 - 275
  • [7] DECOMPOSITION ALGORITHMS FOR LIVE AND SAFE FREE-CHOICE NETS
    NISHIMURA, T
    LEE, DI
    KODAMA, S
    KUMAGAI, S
    ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE, 1995, 78 (01): : 1 - 12
  • [8] A PROOF OF THE RANK THEOREM FOR EXTENDED FREE-CHOICE NETS
    DESEL, J
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 616 : 134 - 153
  • [9] Polynomial Analysis Algorithms for Free-Choice Workflow Nets
    Esparza, Javier
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2017, (253): : 3 - 3
  • [10] Computing the Concurrency Threshold of Sound Free-Choice Workflow Nets
    Meyer, Philipp J.
    Esparza, Javier
    Voelzer, Hagen
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, TACAS 2018, PT II, 2018, 10806 : 3 - 19
12345