A Method for Reachability Problems of P/T Petri Nets using Algebraic Approach

2014 ◽  
Vol 2 ◽  
pp. 475-478
Author(s):  
Masahiro Osogami ◽  
Teruya Yamanishi ◽  
Katsuji Uosaki
1996 ◽  
Vol 41 (12) ◽  
pp. 1751-1778 ◽  
Author(s):  
F. Baccelli ◽  
S. Foss ◽  
B. Gaujal

2019 ◽  
Vol 9 (13) ◽  
pp. 2633
Author(s):  
Sadok Rezig ◽  
Sadok Turki ◽  
Nidhal Rezg

This study attempted to calculate an optimal Petri net supervisor able to respect the control specifications imposed for a flexible manufacturing system. There are several theories around the control synthesis of discrete event systems. Unfortunately, these methods are very sensitive to the combinatorial explosion of states in the generated graph, especially when the complexity of the system increases. It is therefore necessary to move towards new ways based on formal methods allowing the synthesis of a supervisor. In this work, we propose an algebraic approach using the theory of regions. Our main contribution is to design a set of Petri net controllers based on the properties of Petri nets and not on reachability graph generation for bounded Petri nets. This will decrease significantly the production cost of the manufacturing system, since the computation burden of the supervisor is reduced. Our control policy was applied to a flexible manufacturing system implemented in our laboratory. Comparisons with previous studies using CPLEX software are provided in order to illustrate the effectiveness of our proposed method.


2009 ◽  
Vol 129 (5) ◽  
pp. 455-461 ◽  
Author(s):  
Xinhong Hei ◽  
Sei Takahashi ◽  
Hideo Nakamura
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document