Free-choice Nets with Home Clusters are Lucent

被引:3
|
作者
van der Aalst, Wil M. P. [1 ]
机构
[1] Rhein Westfal TH Aachen, Proc & Data Sci PADS, Aachen, Germany
关键词
Petri nets; Free-Choice Nets; Lucent Process Models; PETRI NETS;
D O I
10.3233/FI-2021-2059
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
A marked Petri net is lucent if there are no two different reachable markings enabling the same set of transitions, i.e., states are fully characterized by the transitions they enable. Characterizing the class of systems that are lucent is a foundational and also challenging question. However, little research has been done on the topic. In this paper, it is shown that all free-choice nets having a home cluster are lucent. These nets have a so-called home marking such that it is always possible to reach this marking again. Such a home marking can serve as a regeneration point or as an end-point. The result is highly relevant because in many applications, we want the system to be lucent and many "well-behaved" process models fall into the class identified in this paper. Unlike previous work, we do not require the marked Petri net to be live and strongly-connected. Most of the analysis techniques for free-choice nets are tailored towards well-formed nets. The approach presented in this paper provides a novel perspective enabling new analysis techniques for free-choice nets that do not need to be well-formed. Therefore, we can also model systems and processes that are terminating and/or have an initialization phase.
引用
收藏
页码:273 / 302
页数:30
相关论文
共 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
    Anne Bouillard
    Bruno Gaujal
    Jean Mairesse
    Discrete Event Dynamic Systems, 2006, 16 : 327 - 352
  • [3] Extremal throughputs in free-choice nets
    Bouillard, A
    Gaujal, B
    Mairesse, J
    APPLICATIONS AND THEORY OF PETRI NETS 2005, PROCEEDINGS, 2005, 3536 : 108 - 127
  • [4] Free-choice Petri nets - An algebraic approach
    Baccelli, F
    Foss, S
    Gaujal, B
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1996, 41 (12) : 1751 - 1778
  • [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] Perpetual Free-choice Petri Nets are Lucent Proof of a Theorem of van der Aalst Using CP-exhaustions
    Wehler, Joachim
    FUNDAMENTA INFORMATICAE, 2021, 182 (03) : 363 - 393
  • [7] 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
  • [8] 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
  • [9] A PROOF OF THE RANK THEOREM FOR EXTENDED FREE-CHOICE NETS
    DESEL, J
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 616 : 134 - 153
  • [10] Polynomial Analysis Algorithms for Free-Choice Workflow Nets
    Esparza, Javier
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2017, (253): : 3 - 3