TY - JOUR
T1 - An application of independent, increasing, Free-Choice Petri nets to the synthesis of policies that enforce liveness in arbitrary Petri nets
AU - Sreenivas, Ramavarapu S.
N1 - Funding Information:
A Petri net (PN) N"(%, ¹, ', m0) is an ordered 4-tuple, where %"Mp1, p2, 2, pnN is a set of n places, ¹"Mt1, t2, 2, tmN is a set of m transitions, '-(%]¹)X(¹]%) is a set of arcs, m0 : %PN is the initial marking function (or the initial marking), and N is the set of nonnegative integers. The state of a PN is the * Received 15 April 1997; revised 4 December 1997; received in Þnal form 5 June 1998. This paper was not presented at any IFAC meeting. This paper was recommended for publication in revised form by Associate Editor Christos G. Cassandras under the direction of Editor Tamer Bas,ar. Corresponding author Professor Ramavarapu S. Sreenivas. Tel. 00 1 217 244 1653; Fax 00 217 333 7735; E-mail [email protected]. -Coordinated Science Laboratory and Department of General Engineering, University of Illinois at Urbana-Champaign, Urbana, IL 61801. àThis work was supported in part by grant RES-BRD-IC-SREENIVAS-1-2-68317 from the UIUC Campus Research Board and the National Science Foundation under grant number ECS-9409691.
PY - 1998/12
Y1 - 1998/12
N2 - The class of Independent, Increasing, Free-Choice Petri nets (II-FCPNs) was introduced in (Sreenivas, 1997c), where it is shown that any II-FCPN can be made live via supervision using a readily available policy. In a live Petri net (PN) (Peterson (1981). Petri Net Theory and Modeling of systems. Prentice-Hall, Englewood Cliffs, NJ, Reisig (1985). Petri Nets. Springer, Berlin), it is possible to fire any transition from every reachable marking, although not necessarily immediately. In this paper we identify a class of PNs, where every transition is controllable, that are not necessarily II-FCPNs, that can be made live via supervision using a readily available policy constructed from the policy that enforces liveness in an II-FCPN.
AB - The class of Independent, Increasing, Free-Choice Petri nets (II-FCPNs) was introduced in (Sreenivas, 1997c), where it is shown that any II-FCPN can be made live via supervision using a readily available policy. In a live Petri net (PN) (Peterson (1981). Petri Net Theory and Modeling of systems. Prentice-Hall, Englewood Cliffs, NJ, Reisig (1985). Petri Nets. Springer, Berlin), it is possible to fire any transition from every reachable marking, although not necessarily immediately. In this paper we identify a class of PNs, where every transition is controllable, that are not necessarily II-FCPNs, that can be made live via supervision using a readily available policy constructed from the policy that enforces liveness in an II-FCPN.
KW - Discrete event dynamic systems
KW - Petri nets
KW - Supervisory control
UR - http://www.scopus.com/inward/record.url?scp=0032298247&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0032298247&partnerID=8YFLogxK
U2 - 10.1016/S0005-1098(98)80016-2
DO - 10.1016/S0005-1098(98)80016-2
M3 - Article
AN - SCOPUS:0032298247
SN - 0005-1098
VL - 34
SP - 1613
EP - 1615
JO - Automatica
JF - Automatica
IS - 12
ER -