Simplified proof of the blocking theorem for free-choice Petri nets

被引：5

作者：

Wehler, Joachim ^{[1
]}

机构：

[1] Univ Munich, Fak Math Informat & Stat, D-80333 Munich, Germany

来源：

JOURNAL OF COMPUTER AND SYSTEM SCIENCES | 2010年 / 76卷 / 07期

关键词：

Blocking marking; CP-subnet; Free-choice system;

D O I：

10.1016/j.jcss.2009.10.001

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Every cluster in a bounded and live free-choice system has a unique blocking marking. It can be reached by firing an occurrence sequence, which avoids any transition of the cluster. This theorem is due to Gaujal, Haar and Mairesse. We will give a short proof using standard results on CP-subnets of well-formed free-choice nets. (C) 2009 Elsevier Inc. All rights reserved.

引用

页码：532 / 537

页数：6

共 50 条

[1] A PROOF OF THE RANK THEOREM FOR EXTENDED FREE-CHOICE NETS
DESEL, J
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1992, 616 : 134 - 153
[2] Free-choice Petri nets - An algebraic approach
Baccelli, F
Foss, S
Gaujal, B
[J]. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1996, 41 (12) : 1751 - 1778
[3] On probabilistic diagnosis for free-choice Petri Nets
Flochova, Jana
Boel, Rene K.
Jiroveanu, George
[J]. 2007 AMERICAN CONTROL CONFERENCE, VOLS 1-13, 2007, : 5541 - +
[4] Perpetual Free-choice Petri Nets are Lucent Proof of a Theorem of van der Aalst Using CP-exhaustions
Wehler, Joachim
[J]. FUNDAMENTA INFORMATICAE, 2021, 182 (03) : 363 - 393
[5] Optimal sensor choice for observability in Free-choice Petri Nets
Aguirre-Salas, L
Begovich, O
Ramirez-Treviño, A
[J]. PROCEEDINGS OF THE 2001 IEEE INTERNATIONAL SYMPOSIUM ON INTELLIGENT CONTROL (ISIC'01), 2001, : 270 - 275
[6] On commoner's liveness theorem and supervisory policies that enforce liveness in free-choice Petri nets
Sreenivas, RS
[J]. SYSTEMS & CONTROL LETTERS, 1997, 31 (01) : 41 - 48
[7] REDUCTION AND SYNTHESIS OF LIVE AND BOUNDED FREE-CHOICE PETRI NETS
ESPARZA, J
[J]. INFORMATION AND COMPUTATION, 1994, 114 (01) : 50 - 87
[8] On the Step Branching Time Closure of Free-Choice Petri Nets
Mennicke, Stephan
Schicke-Uffmann, Jens-Wolfhard
Goltz, Ursula
[J]. FORMAL TECHNIQUES FOR DISTRIBUTED OBJECTS, COMPONENTS, AND SYSTEMS, 2014, 8461 : 232 - 248
[9] A Polynomial Time Flow for Implementing Free-Choice Petri-Nets
Mattheakis, Pavlos M.
Sotiriou, Christos P.
Beerel, Peter A.
[J]. 2012 IEEE 30TH INTERNATIONAL CONFERENCE ON COMPUTER DESIGN (ICCD), 2012, : 227 - 234
[10] Decomposition of transition systems into sets of synchronizing Free-choice Petri Nets
Teren, Viktor
Cortadella, Jordi
Villa, Tiziano
[J]. 2022 25TH EUROMICRO CONFERENCE ON DIGITAL SYSTEM DESIGN (DSD), 2022, : 165 - 173

← 1 2 3 4 5 →