On commoner's liveness theorem and supervisory policies that enforce liveness in free-choice Petri nets

被引:11
作者
Sreenivas, RS [1 ]
机构
[1] UNIV ILLINOIS,DEPT GEN ENGN,URBANA,IL 61801
基金
美国国家科学基金会;
关键词
discrete event dynamic systems; supervisory control; Petri nets;
D O I
10.1016/S0167-6911(97)00019-4
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A Petri net (PN) (Peterson, 1981; Reisig, 1985) is said to be live if it is possible to fire any transition from every reachable marking, although not necessarily immediately. A free-choice Petri net (FCPN) is a PN, where every are from a place to a transition is either the unique output are from that place or it is the unique input are to the transition. Commoner's Liveness Theorem (cf. Hack, 1972, Ch. 4; Reisig, 1985, Section 7.2) states that a FCPN is live if and only if every siphon contains a marked trap at the initial marking. A siphon (trap) is a collection of places P such that . P subset of or equal to P . (P . subset of or equal to . P). We concern ourselves with marking-dependent supervisory policies that can prevent the tiring of a transition. We characterize supervisory policies that enforce liveness in non-live FCPNs using observations that strongly parallel Commoner's Liveness Theorem. We use this characterization to establish the existence of supervisory policies that enforce liveness in a Class of FCPNs called independent, increasing free-choice petri nets (II-FCPNs). (C) 1997 Elsevier Science B.V.
引用
收藏
页码:41 / 48
页数:8
相关论文
共 7 条
[1]  
[Anonymous], THESIS MIT
[2]  
GAREY MR, 1979, COMPUTERS INTRACATAB
[3]  
Peterson J., 1981, PETRI NET THEORY MOD
[4]   THE CONTROL OF DISCRETE EVENT SYSTEMS [J].
RAMADGE, PJG ;
WONHAM, WM .
PROCEEDINGS OF THE IEEE, 1989, 77 (01) :81-98
[5]  
Reisig Wolfgang., 2012, PETRI NETS INTRO, V4
[6]  
Ribenboim P, 1994, CATALANS CONJECTURE
[7]  
TANNENBAUM A, 1987, OPERATING SYSTEMS DE