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 条
  • [41] Trace nets and conflict-free computations
    Ochmanski, Edward
    Pieckowska, Joanna
    FUNDAMENTA INFORMATICAE, 2006, 72 (1-3) : 311 - 321
  • [42] State estimation of λ-free labeled Petri nets with contact-free nondeterministic transitions
    Giua, A
    Corona, D
    Seatzu, C
    DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS, 2005, 15 (01): : 85 - 108
  • [43] State Estimation of λ-free Labeled Petri Nets with Contact-Free Nondeterministic Transitions*
    Alessandro Giua
    Daniele Corona
    Carla Seatzu
    Discrete Event Dynamic Systems, 2005, 15 : 85 - 108
  • [44] A Label-Free Similarity Measure between Workflow Nets
    Zha, Haiping
    Wang, Jianmin
    Wen, Lijie
    Wang, Chaokun
    2009 IEEE ASIA-PACIFIC SERVICES COMPUTING CONFERENCE (APSCC 2009), 2009, : 416 - +
  • [45] CTL Model Repair for Bounded and Deadlock Free Petri Nets
    Martinez-Araiza, Ulises
    Lopez-Mellado, Ernesto
    IFAC PAPERSONLINE, 2015, 48 (07): : 154 - 160
  • [46] PSPACE-Completeness of the Soundness Problem of Safe Asymmetric-Choice Workflow Nets
    Liu, Guanjun
    APPLICATION AND THEORY OF PETRI NETS AND CONCURRENCY (PETRI NETS 2020), 2020, 12152 : 196 - 216
  • [47] Co-NP-Hardness of the Soundness Problem for Asymmetric-Choice Workflow Nets
    Liu, Guanjun
    Jiang, Changjun
    IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2015, 45 (08): : 1201 - 1204
  • [48] A valuation-based analysis of conflict-free Petri nets
    Yen, HC
    SYSTEMS & CONTROL LETTERS, 2002, 45 (05) : 387 - 395
  • [49] Deadlock-free scheduling of OHT transport systems based on Petri nets
    Zhou, B. (bhzhou@tongji.edu.cn), 2013, Central South University of Technology (44):
  • [50] Petri nets based deadlock-free scheduling for flexible manufacturing systems
    He, Y. L.
    Wang, G. N.
    2006 9TH INTERNATIONAL CONFERENCE ON CONTROL, AUTOMATION, ROBOTICS AND VISION, VOLS 1- 5, 2006, : 1167 - +