This article proposes an iterative deadlock resolution method for flexible manufacturing systems modeled with G-systems. To design a non-blocking controlled system with maximally permissive behavior in a G-system (GS), a reachability graph-based analysis technology is utilized. Since the reachability graph of a large-scale GS easily becomes unmanageable, an optimal non-blocking supervisor becomes a challenging problem in a GS. To facilitate this problem, the Divide-and-Conquer approach is a good choice for complex G-systems. First, an uncontrolled GS resolves into a number of associated subnets. Then, every subnet suffering from deadlocks is utilized to design the liveness-enforcing supervisor for the original GS. Thus, additional monitors can be obtained if the liveness of all subnets is achieved. Subsequently, a partially controlled GS is derived by including all monitors within the GS, and its liveness can be ensured by designing a new set of monitors. Consequently, a non-blocking GS is derived. The major advantage of the proposed method is that a non-blocking supervisor with near-optimal behavioral permissiveness can be obtained in general. Finally, a typical GS example popularly studied in the literature is applied to demonstrate the validity and the availability of the method in this article.
%0 Journal Article
%1 ZhaoUzamHou16
%A Zhao, Mi
%A Uzam, Murat
%A Hou, YiFan
%D 2016
%I SAGE Publications
%J Advances in Mechanical Engineering
%K and, citas, citeulike conquer, divide, fms, referencias, supervisory
%N 3
%P 1687814016639823+
%R 10.1177/1687814016639823
%T Near-optimal supervisory control of flexible manufacturing systems using divide-and-conquer iterative method
%U http://dx.doi.org/10.1177/1687814016639823
%V 8
%X This article proposes an iterative deadlock resolution method for flexible manufacturing systems modeled with G-systems. To design a non-blocking controlled system with maximally permissive behavior in a G-system (GS), a reachability graph-based analysis technology is utilized. Since the reachability graph of a large-scale GS easily becomes unmanageable, an optimal non-blocking supervisor becomes a challenging problem in a GS. To facilitate this problem, the Divide-and-Conquer approach is a good choice for complex G-systems. First, an uncontrolled GS resolves into a number of associated subnets. Then, every subnet suffering from deadlocks is utilized to design the liveness-enforcing supervisor for the original GS. Thus, additional monitors can be obtained if the liveness of all subnets is achieved. Subsequently, a partially controlled GS is derived by including all monitors within the GS, and its liveness can be ensured by designing a new set of monitors. Consequently, a non-blocking GS is derived. The major advantage of the proposed method is that a non-blocking supervisor with near-optimal behavioral permissiveness can be obtained in general. Finally, a typical GS example popularly studied in the literature is applied to demonstrate the validity and the availability of the method in this article.
@article{ZhaoUzamHou16,
abstract = {{This article proposes an iterative deadlock resolution method for flexible manufacturing systems modeled with G-systems. To design a non-blocking controlled system with maximally permissive behavior in a G-system (GS), a reachability graph-based analysis technology is utilized. Since the reachability graph of a large-scale GS easily becomes unmanageable, an optimal non-blocking supervisor becomes a challenging problem in a GS. To facilitate this problem, the Divide-and-Conquer approach is a good choice for complex G-systems. First, an uncontrolled GS resolves into a number of associated subnets. Then, every subnet suffering from deadlocks is utilized to design the liveness-enforcing supervisor for the original GS. Thus, additional monitors can be obtained if the liveness of all subnets is achieved. Subsequently, a partially controlled GS is derived by including all monitors within the GS, and its liveness can be ensured by designing a new set of monitors. Consequently, a non-blocking GS is derived. The major advantage of the proposed method is that a non-blocking supervisor with near-optimal behavioral permissiveness can be obtained in general. Finally, a typical GS example popularly studied in the literature is applied to demonstrate the validity and the availability of the method in this article.}},
added-at = {2017-09-08T10:52:59.000+0200},
author = {Zhao, Mi and Uzam, Murat and Hou, YiFan},
biburl = {https://www.bibsonomy.org/bibtex/2ceec5fb9bdc1ad845d54c08312cf8112/fernand0},
citeulike-article-id = {14024287},
citeulike-linkout-0 = {http://dx.doi.org/10.1177/1687814016639823},
citeulike-linkout-1 = {http://ade.sagepub.com/content/8/3/1687814016639823.abstract},
citeulike-linkout-2 = {http://ade.sagepub.com/content/8/3/1687814016639823.full.pdf},
day = 01,
doi = {10.1177/1687814016639823},
interhash = {e68ea69a291608c8671a6502a7b62f9b},
intrahash = {ceec5fb9bdc1ad845d54c08312cf8112},
issn = {1687-8140},
journal = {Advances in Mechanical Engineering},
keywords = {and, citas, citeulike conquer, divide, fms, referencias, supervisory},
month = mar,
number = 3,
pages = {1687814016639823+},
posted-at = {2016-04-29 17:14:04},
priority = {2},
publisher = {SAGE Publications},
timestamp = {2017-09-08T10:53:23.000+0200},
title = {{Near-optimal supervisory control of flexible manufacturing systems using divide-and-conquer iterative method}},
url = {http://dx.doi.org/10.1177/1687814016639823},
volume = 8,
year = 2016
}