Abstract | ||
---|---|---|
In this paper, the forbidden state problem, in the context of supervisory control of discrete event systems modelled by Petri nets, is discussed. The forbidden state problem is specified by generalized mutual exclusion constraints (GMECs). The case of backward conflict free and free choice uncontrollable subnet is considered. The uncontrollable subnet is first extended to a number of well formed free choice nets and then decomposed in marked graph components, which can be obtained from minimal T-invariants of the extended net. The forbidden state problem is so re-formulated into an equivalent one, based on the decomposed net, such that it can be solved by a linear programming problem. Thus, a polynomial complexity solution, suitable for on-line control, is achieved, improving the existing results in literature for this net subclass. Copyright c 2005 IFAC. |
Year | DOI | Venue |
---|---|---|
2007 | 10.1109/TAC.2007.893969 | IEEE Transactions on Automatic Control |
Keywords | Field | DocType |
Feedback control,Logic,Supervisory control,Automatic control,Control systems,Discrete event systems,Petri nets,Context modeling,Discrete transforms,Linear programming | Marked graph,Discrete mathematics,Petri net,Supervisory control,Theoretical computer science,Subnet,Polynomial complexity,Control logic,Linear programming,Mutual exclusion,Mathematics | Journal |
Volume | Issue | ISSN |
52 | 3 | 0018-9286 |
Citations | PageRank | References |
16 | 0.81 | 10 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Francesco Basile | 1 | 161 | 11.25 |
Ciro Carbone | 2 | 41 | 3.39 |
Pasquale Chiacchio | 3 | 421 | 46.31 |