This paper develops a place invariant based deadlock prevention method to obtain an optimal, i.e., maximally permissive, liveness-enforcing Petri net supervisor with a minimal supervisory structure that means the minimal number of control places. Maximal permissiveness can be achieved by designing place invariants that make all legal markings reachable while all first-met bad markings unreachable. An integer linear programming problem is formulated to compute all place invariants and its objective function minimizes the number of place invariants, aiming to yield a minimal supervisory structure. Importantly, we develop a technique to greatly improve the efficiency of the proposed method by reducing the number of constraints and variables in the integer linear programming problem under consideration. A number of examples from the literature are used to illustrate the proposed approaches.
%0 Journal Article
%1 ChenLi12
%A Chen, YuFeng
%A Li, ZhiWu
%D 2012
%J Automatica
%K citas, citeulike deadlock, nets, petri, prevention, referencias
%N 10
%P 2647--2656
%R 10.1016/j.automatica.2012.06.068
%T On structural minimality of optimal supervisors for flexible manufacturing systems
%U http://dx.doi.org/10.1016/j.automatica.2012.06.068
%V 48
%X This paper develops a place invariant based deadlock prevention method to obtain an optimal, i.e., maximally permissive, liveness-enforcing Petri net supervisor with a minimal supervisory structure that means the minimal number of control places. Maximal permissiveness can be achieved by designing place invariants that make all legal markings reachable while all first-met bad markings unreachable. An integer linear programming problem is formulated to compute all place invariants and its objective function minimizes the number of place invariants, aiming to yield a minimal supervisory structure. Importantly, we develop a technique to greatly improve the efficiency of the proposed method by reducing the number of constraints and variables in the integer linear programming problem under consideration. A number of examples from the literature are used to illustrate the proposed approaches.
@article{ChenLi12,
abstract = {{This paper develops a place invariant based deadlock prevention method to obtain an optimal, i.e., maximally permissive, liveness-enforcing Petri net supervisor with a minimal supervisory structure that means the minimal number of control places. Maximal permissiveness can be achieved by designing place invariants that make all legal markings reachable while all first-met bad markings unreachable. An integer linear programming problem is formulated to compute all place invariants and its objective function minimizes the number of place invariants, aiming to yield a minimal supervisory structure. Importantly, we develop a technique to greatly improve the efficiency of the proposed method by reducing the number of constraints and variables in the integer linear programming problem under consideration. A number of examples from the literature are used to illustrate the proposed approaches.}},
added-at = {2017-09-08T10:52:59.000+0200},
author = {Chen, YuFeng and Li, ZhiWu},
biburl = {https://www.bibsonomy.org/bibtex/2e09ba77ca0b67fe6d6ac82d83c5bc8dd/fernand0},
citeulike-article-id = {11011438},
citeulike-linkout-0 = {http://dx.doi.org/10.1016/j.automatica.2012.06.068},
doi = {10.1016/j.automatica.2012.06.068},
interhash = {8c1c2b38c1e12010d6721d15499f2b64},
intrahash = {e09ba77ca0b67fe6d6ac82d83c5bc8dd},
issn = {00051098},
journal = {Automatica},
keywords = {citas, citeulike deadlock, nets, petri, prevention, referencias},
month = oct,
number = 10,
pages = {2647--2656},
posted-at = {2012-11-02 09:27:13},
priority = {2},
timestamp = {2017-09-08T10:53:23.000+0200},
title = {{On structural minimality of optimal supervisors for flexible manufacturing systems}},
url = {http://dx.doi.org/10.1016/j.automatica.2012.06.068},
volume = 48,
year = 2012
}