Design of a Maximally Permissive Liveness- Enforcing Petri Net Supervisor for Flexible Manufacturing Systems

Chen, Yu Feng; Li, Zhiwu; Khalgui, Mohamed; Mosbahi, Olfa

doi:10.1109/tase.2010.2060332

Cited by 242 publications

(183 citation statements)

References 45 publications

Supporting

Mentioning

183

Contrasting

Order By: Relevance

“…Pcont-SPN2 (Figure 7) is the timed model of a production system that processes a single type of products according to two possible jobs [27,28]. The first job is composed of the transitions t 1 to t 8, and the second one by the transitions t 9 to t 14 .…”

Section: Resultsmentioning

confidence: 99%

Dynamical Scheduling and Robust Control in Uncertain Environments with Petri Nets for DESs

Lefebvre

2017

Processes

View full text Add to dashboard Cite

This paper is about the incremental computation of control sequences for discrete event systems in uncertain environments where uncontrollable events may occur. Timed Petri nets are used for this purpose. The aim is to drive the marking of the net from an initial value to a reference one, in minimal or near-minimal time, by avoiding forbidden markings, deadlocks, and dead branches. The approach is similar to model predictive control with a finite set of control actions. At each step only a small area of the reachability graph is explored: this leads to a reasonable computational complexity. The robustness of the resulting trajectory is also evaluated according to a risk probability. A sufficient condition is provided to compute robust trajectories. The proposed results are applicable to a large class of discrete event systems, in particular in the domains of flexible manufacturing. However, they are also applicable to other domains as communication, computer science, transportation, and traffic as long as the considered systems admit Petri Nets (PNs) models. They are suitable for dynamical deadlock-free scheduling and reconfiguration problems in uncertain environments.

show abstract

Section: Resultsmentioning

confidence: 99%

Dynamical Scheduling and Robust Control in Uncertain Environments with Petri Nets for DESs

Lefebvre

2017

Processes

View full text Add to dashboard Cite

show abstract

“…In fact, many studies have been conducted on reachability graph analysis which represents a significant technique for synthesizing optimal/near-optimal PN controllers [10][11][12][13]. In [13], a RG based method is developed to calculate an optimal PN supervisor with the fewest control places for FMS modeled by PN.…”

Section: Introductionmentioning

confidence: 99%

“…The states in live zone are legal ones for a Flexible manufacturing system (FMS), and those in deadlock zone are deadlock or will lead to deadlocks. In [10], a vector covering method is used to reduce the number of markings to consider in the synthesis of PN controllers. An optimal supervisor with the fewest control places can be designed by solving a Minimal number of control places problem (MCCP).…”

Section: Introductionmentioning

confidence: 99%

Theory of Regions for Control Synthesis without Computing Reachability Graph

2017

View full text Add to dashboard Cite

This paper addresses the design of Petri net (PN) supervisor using the theory of regions for forbidden state problem with a set of general mutual exclusion constraints. In fact, as any method of supervisory control based on reachability graph, the theory of regions suffers from a technical obstacle in control synthesis, which is the necessity of computing the graph at each iteration step. Moreover, based on the reachability graph, which may contain a large number of states, with respect to the structural size of the system, the computation of PN controllers becomes harder and even impossible. The main contribution of this paper, compared to previous works, is the development of a control synthesis method in order to decrease significantly the computation cost of the PN supervisor. Thus, based on PN properties and mathematical concepts, the proposed methodology provides an optimal PN supervisor for bounded Petri nets following the interpretation of the theory of regions. Finally, case studies are solved by CPLEX software to compare our new control policy with previous works which use the theory of regions for control synthesis.

show abstract

“…Besides, BDDs can implement efficient manipulation on the sets of reachable markings. In order to overcome the state explosion problem, BDD is used by Chen et al 13 to represent the state space. However, the method still requires a complete enumeration of reachable markings whose number increases exponentially with the size of a Petri net.…”

Section: Introductionmentioning

confidence: 99%

On calculation of state space for linear system of simple sequential processes with resources

Hong

Wang

et al. 2017

Advances in Mechanical Engineering

Self Cite

View full text Add to dashboard Cite

This work focuses on the calculation of state space for linear system of simple sequential processes with resources (LS 3 PR). The method, different from reachability graphs rendering high computational complexity, finds reachable markings by combinatorics. First, the set of invariant markings can be obtained by combinatorics if the influence of deadlocks is ignored. Unfortunately, some of reachable states in the set of invariant markings are proved to be spurious if deadlocks exist. Second, we find the spurious markings by computing a set of minimal spurious markings, which can be calculated by a proposed algorithm based on strict minimal siphons. The obtained spurious markings are proved to cover all the spurious markings of the LS 3 PR. Removing the spurious markings from the set of invariant markings, the left ones constitute the state space of the LS 3 PR. The detailed method is shaped to an algorithm. The effectiveness of the algorithm is proved by example calculation and analysis. Finally, we analyze the computational complexity of the proposed method compared with reachability graphs.

show abstract

Design of a Maximally Permissive Liveness- Enforcing Petri Net Supervisor for Flexible Manufacturing Systems

Cited by 242 publications

References 45 publications

Dynamical Scheduling and Robust Control in Uncertain Environments with Petri Nets for DESs

Dynamical Scheduling and Robust Control in Uncertain Environments with Petri Nets for DESs

Theory of Regions for Control Synthesis without Computing Reachability Graph

On calculation of state space for linear system of simple sequential processes with resources

Contact Info

Product

Resources

About