scholarly journals Mixed Integer Programming-Based Liveness Test for FMS with Full Routing Flexibility

2014 ◽  
Vol 2014 ◽  
pp. 1-12
Author(s):  
Lida Dong ◽  
Tianyang Chi ◽  
Chengcheng Zhu ◽  
Jun Yin
Keyword(s):  
Integer Programming ◽  
Petri Nets ◽  
Mixed Integer Programming ◽  
Flexible Manufacturing ◽  
Flexible Manufacturing Systems ◽  
Manufacturing Systems ◽  
Mixed Integer ◽  
Routing Flexibility ◽  
Liveness Property

Mixed integer programming (MIP) is an important technique to verify the liveness property of sequential flexible manufacturing systems (FMS) modeled by Petri nets. When there are some fully flexible routings in FMS, the existing MIP-based methods are not suitable for testing their liveness. This paper defines a subclass of S*PR nets firstly, namely, OSC-S*PR nets, and concludes that an OSC-S*PR net is live if there exist no non-max′-controlled siphons. Accordingly, determining whether or not an OSC-S*PR net is live can also be realized by using standardized mixed integer programming (MIP) tools. Furthermore, the liveness property of S*PR nets can be tested in two steps: first, for a given S*PR net, constructing an OSC-S*PR net to ensure that if the latter is live then the former must be live; second, testing liveness of the constructed OSC-S*PR net by the aforementioned MIP-based algorithm. In the end, the performance of the method is demonstrated by an application of FMS.

Petri Net Based Deadlock Prevention Approach for Flexible Manufacturing Systems

2011 ◽  
pp. 416-433 ◽  
Author(s):  
Chunfu Zhong ◽  
Zhiwu Li
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Flexible Manufacturing ◽  
Mixed Integer Linear Programming ◽  
Flexible Manufacturing Systems ◽  
Manufacturing Systems ◽  
Iteration Step ◽  
Mixed Integer ◽  
Deadlock Prevention ◽  
Prevention Approach

In flexible manufacturing systems, deadlocks usually occur due to the limited resources. To cope with deadlock problems, Petri nets are widely used to model these systems. This chapter focuses on deadlock prevention for flexible manufacturing systems that are modeled with S4R nets, a subclass of generalized Petri nets. The analysis of S4R leads us to derive an iterative deadlock prevention approach. At each iteration step, a non-max-controlled siphon is derived by solving a mixed integer linear programming. A monitor is constructed for the siphon such that it is max-controlled. Finally, a liveness-enforcing Petri net supervisor can be derived without enumerating all the strict minimal siphons.

Petri Net Based Deadlock Prevention Approach for Flexible Manufacturing Systems

2012 ◽  
pp. 445-463
Author(s):  
Chunfu Zhong ◽  
Zhiwu Li
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Flexible Manufacturing ◽  
Mixed Integer Linear Programming ◽  
Flexible Manufacturing Systems ◽  
Manufacturing Systems ◽  
Iteration Step ◽  
Mixed Integer ◽  
Deadlock Prevention ◽  
Prevention Approach

In flexible manufacturing systems, deadlocks usually occur due to the limited resources. To cope with deadlock problems, Petri nets are widely used to model these systems. This chapter focuses on deadlock prevention for flexible manufacturing systems that are modeled with S4R nets, a subclass of generalized Petri nets. The analysis of S4R leads us to derive an iterative deadlock prevention approach. At each iteration step, a non-max-controlled siphon is derived by solving a mixed integer linear programming. A monitor is constructed for the siphon such that it is max-controlled. Finally, a liveness-enforcing Petri net supervisor can be derived without enumerating all the strict minimal siphons.

Sign in / Sign up

Export Citation Format

Share Document