#### DMCA

## Synthesis of T-Liveness Enforcing Supervisors in Petri Nets

### Citations

2070 |
Petri nets: Properties, analysis and applications.
- MURATA
- 1989
(Show Context)
Citation Context .... Similarly, we say that liveness can be enforced in N if an initial marking 0 and a supervisor exist such that (N ; 0) supervised by is live. 4 A Petri net is said to be (partially) repetitive =-=[10]-=- if a marking 0 and asring sequence enabled by 0 exist such that every (some) transition occurs innitely often in . It is known [10] that a Petri net is (partially) repetitive i a vector x of p... |

131 |
A Petri net based deadlock prevention policy for flexible manufacturing systems
- Colom, Martinez
- 1995
(Show Context)
Citation Context ...ets. A necessary and sucient condition for the existence of liveness supervisors appears in [13]. A method for liveness enforcement in a class of conservative ordinary Petri nets 2 has been given in =-=[3]-=-; the approach is not least restrictive. The approach of [3] has been recently extended to generalized Petri nets in [11]. Polynomial complexity has been proved, however the considered Petri nets are ... |

65 | Feedback control of Petri nets based on place invariants
- Yamalidou, Moody, et al.
- 1996
(Show Context)
Citation Context ...every iteration correcting new deadlock situations. Using iterations to correct deadlock situations has also been used in [8]. In our procedure we employ supervisory control based on place invariants =-=[9, 16]-=-, which is an established method in the supervisory control of Petri nets. We also use a transformation to almost ordinary Petri nets and a transformation to asymmetric choice nets. Thesrst transforma... |

61 |
Supervisory Control of Discrete Event Systems Using Petri Nets
- Moody, Antsaklis
- 1998
(Show Context)
Citation Context ...every iteration correcting new deadlock situations. Using iterations to correct deadlock situations has also been used in [8]. In our procedure we employ supervisory control based on place invariants =-=[9, 16]-=-, which is an established method in the supervisory control of Petri nets. We also use a transformation to almost ordinary Petri nets and a transformation to asymmetric choice nets. Thesrst transforma... |

24 | On the existence of supervisory policies that enforce liveness in discrete-event dynamic systems modeled by controlled Petri nets
- Sreenivas
- 1997
(Show Context)
Citation Context ...esults exist on other liveness topics. Previous constructive results consider restricted classes of Petri nets. A necessary and sucient condition for the existence of liveness supervisors appears in =-=[13]-=-. A method for liveness enforcement in a class of conservative ordinary Petri nets 2 has been given in [3]; the approach is not least restrictive. The approach of [3] has been recently extended to gen... |

21 |
On liveness and controlled siphons in Petri nets
- Barkaoui, Pradat-Peyre
- 1996
(Show Context)
Citation Context ...lent of a Petri net can be used to enforce liveness in the original Petri net. Our interest for asymmetric choice nets stems from a generalization of the Commoner’s Theorem for asymmetric choice nets =-=[2]-=-, which relates liveness in asymmetric choice Petri nets to siphons. We begin in section 2 by introducing notations, denitions and results important for our procedure. The theoretical background of o... |

12 |
On the existence of liveness-enforcing supervisory policies of discrete-event systems modeled by n-safe Petri nets
- He, Lemmon
- 2000
(Show Context)
Citation Context ...r a restricted class of ordinary Petri nets is given in [14]. Another liveness enforcing approach appears in [15]; it is based on the coverability graph, and hence the initial marking is required. In =-=[4]-=- the authors consider enforcing liveness based on the unfolding of a Petri net. Unfolding is an ecient technique of searching the reachability graph. The approach of [4] is limited to bounded Petri n... |

9 | On a free-choice equivalent of a Petri net
- Sreenivas
- 1997
(Show Context)
Citation Context ...tric choice nets. Thesrst transformation was inspired by a similar transformation in [8]. A transformation to free choice nets, which is a particular class of asymmetric choice nets, has been used in =-=[12]-=-. In [12] it is shown that liveness enforcing policies of a free choice equivalent of a Petri net can be used to enforce liveness in the original Petri net. Our interest for asymmetric choice nets ste... |

9 | An application of independent, increasing, free-choice Petri nets to the synthesis of policies that enforce liveness in arbitrary Petri nets
- Sreenivas
- 1998
(Show Context)
Citation Context ... has been proved, however the considered Petri nets are conservative and the approach is not least restrictive. A liveness enforcing approach for a restricted class of ordinary Petri nets is given in =-=[14]-=-. Another liveness enforcing approach appears in [15]; it is based on the coverability graph, and hence the initial marking is required. In [4] the authors consider enforcing liveness based on the unf... |

8 | Antsaklis, “Automated synthesis of deadlock prevention supervisors using petri nets
- Iordache, Moody, et al.
- 2002
(Show Context)
Citation Context ...e approach of [4] is limited to bounded Petri nets and the initial marking must be known. Our approach is most related to the deadlock prevention procedure we presented in [7], and its improvement in =-=[5]-=-. While our former procedure prevented deadlock but was not guaranteed to enforce liveness, the procedure of this paper is guaranteed to enforce liveness. The liveness enforcement procedure of this pa... |

8 |
A method for the synthesis of deadlock prevention controllers in systems modeled by Petri nets
- Iordache, Moody, et al.
- 2000
(Show Context)
Citation Context ...g the reachability graph. The approach of [4] is limited to bounded Petri nets and the initial marking must be known. Our approach is most related to the deadlock prevention procedure we presented in =-=[7]-=-, and its improvement in [5]. While our former procedure prevented deadlock but was not guaranteed to enforce liveness, the procedure of this paper is guaranteed to enforce liveness. The liveness enfo... |

8 | The linear algebra of deadlock avoidance { a Petri net approach
- Lautenbach, Ridder
- 1996
(Show Context)
Citation Context ...e liveness. The liveness enforcement procedure of this paper is iterative, at every iteration correcting new deadlock situations. Using iterations to correct deadlock situations has also been used in =-=[8]-=-. In our procedure we employ supervisory control based on place invariants [9, 16], which is an established method in the supervisory control of Petri nets. We also use a transformation to almost ordi... |

5 |
Deadlock avoidance in fmss based on structural theory of Petri nets
- Barkaoui, Abdallah
- 1995
(Show Context)
Citation Context ...arking. The siphon S can be invariant controlled in order to always satisfy (5). The invariant is created by adding an additional place, called control place, which we denote by C. See Theorem 2.1 or =-=[3, 1, 2]-=-. Thus the equation of the marking of C is (C) = X p2S (p)− 1 (6) The constraint (5) may not be admissible when the Petri net has unobservable and uncontrollable transitions. If this is the case, th... |

4 |
Structural control of sequential resource allocation systems with multiple resource acquisitions and flexible routings
- Park, Reveliotis
- 2000
(Show Context)
Citation Context ... enforcement in a class of conservative ordinary Petri nets 2 has been given in [3]; the approach is not least restrictive. The approach of [3] has been recently extended to generalized Petri nets in =-=[11]-=-. Polynomial complexity has been proved, however the considered Petri nets are conservative and the approach is not least restrictive. A liveness enforcing approach for a restricted class of ordinary ... |

2 | Automated synthesis of liveness enforcement supervisors using Petri nets. Technical report of the isis group
- Iordache, Moody, et al.
- 2000
(Show Context)
Citation Context ...ransition in T0 that appears in . Then we can write as = 1 0 1, where t1 appears only once in 1. It can be proved that 1 contains a subsequence 0;k(t1) (we prove this as Proposition 6.13 in =-=[6]-=-). Since all transition of before t1 are in TR, andsring them only decrease markings of P0 [ C, 0;k(t1) is enabled by k, since it is enabled aftersring the transitions that precede it in . Let t2... |