Canonical prefixes of Petri net unfoldings

被引:54
|
作者
Khomenko, V [1 ]
Koutny, M
Vogler, W
机构
[1] Newcastle Univ, Sch Comp Sci, Newcastle Upon Tyne NE1 7RU, Tyne & Wear, England
[2] Univ Augsburg, Inst Informat, D-86135 Augsburg, Germany
关键词
D O I
10.1007/s00236-003-0122-y
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we develop a general technique for truncating Petri net unfoldings, parameterized according to the level of information about the original unfolding one wants to preserve. Moreover, we propose a new notion of completeness of a truncated unfolding. A key aspect of our approach is an algorithm-independent notion of cut-off events, used to truncate a Petri net unfolding. Such a notion is based on a cutting context and results in the unique canonical prefix of the unfolding. Canonical prefixes are complete in the new, stronger sense, and we provide necessary and sufficient conditions for its finiteness, as well as upper bounds on its size in certain cases. A surprising result is that after suitable generalization, the standard unfolding algorithm presented in [8], and the parallel unfolding algorithm proposed in [12], despite being non-deterministic, generate the canonical prefix. This gives an alternative correctness proof for the former algorithm, and a new (much simpler) proof for the latter one.
引用
收藏
页码:95 / 118
页数:24
相关论文
共 50 条
  • [41] The Petri Net Baukasten of the DFG Forschergruppe PETRI NET TECHNOLOGY
    Weber, H
    Ehrig, H
    Reisig, W
    Borusan, A
    Lembke, S
    Dehnert, J
    Weber, M
    Martens, A
    Padberg, J
    Ermel, C
    Qemali, A
    PETRI NET TECHNOLOGY FOR COMMUNICATION-BASED SYSTEMS, 2003, 2472 : 1 - 21
  • [42] Implementation of a large Petri Net by a group of Petri Net Controller
    Kamakura, T
    Shimoda, T
    Dohi, Y
    Murakoshi, H
    IECON '97 - PROCEEDINGS OF THE 23RD INTERNATIONAL CONFERENCE ON INDUSTRIAL ELECTRONICS, CONTROL, AND INSTRUMENTATION, VOLS. 1-4, 1997, : 1210 - 1215
  • [43] VALIDATION OF PETRI NET MODELS BY PETRI-NET-MACHINE
    STARKE, PH
    SYSTEMS ANALYSIS MODELLING SIMULATION, 1988, 5 (03): : 253 - 261
  • [44] Depth-First Net Unfoldings and Equivalent Reduction
    Yang, Xu
    Ye, Chen
    Chen, Yijun
    SYMMETRY-BASEL, 2023, 15 (09):
  • [45] A negative result on depth-first net unfoldings
    Esparza J.
    Kanade P.
    Schwoon S.
    Int. J. Softw. Tools Technol. Trans., 2008, 2 (161-166): : 161 - 166
  • [46] Process net system of Petri net
    Zeng, Qing-Tian
    Wu, Zhe-Hui
    Jisuanji Xuebao/Chinese Journal of Computers, 2002, 25 (12): : 1308 - 1315
  • [47] How Much Is Worth to Remember? A Taxonomy Based on Petri Nets Unfoldings
    Pinna, G. Michele
    APPLICATIONS AND THEORY OF PETRI NETS, 2011, 6709 : 109 - 128
  • [48] Petri net ontology
    Gasevic, Dragan
    Devedzic, Vladan
    KNOWLEDGE-BASED SYSTEMS, 2006, 19 (04) : 220 - 234
  • [49] The petri net kernel
    Weber, Michael
    Kindler, Ekkart
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2003, 2472 : 109 - 124
  • [50] The Petri Net Kernel
    Weber, M
    Kindler, E
    PETRI NET TECHNOLOGY FOR COMMUNICATION-BASED SYSTEMS, 2003, 2472 : 109 - 123