State and firing sequence estimation of Petri Net application to: Manufacturing sysems

2013 ◽  
Author(s):  
Fayssal Arichi ◽  
Brahim Cherki ◽  
Mohamed Djemai
Keyword(s):  
Petri Net ◽  
Sequence Estimation ◽  
Firing Sequence

An Algorithm for Seeking the Minimal Cost Maximal Flow Based on Petri Net

2012 ◽  
Vol 490-495 ◽  
pp. 1353-1357
Author(s):  
Hai Bo Mu ◽  
Yu Bo Song
Keyword(s):  
Petri Net ◽  
Minimal Cost ◽  
Maximal Flow ◽  
The Cost ◽  
The Given ◽  
Firing Sequence

In this paper, Petri net is adopted for seeking the minimal cost maximal flow of a network. The cost Petri net is proposed and the enabled rules of transitions are given. In addition, an algorithm for obtaining the minimal cost maximal flow based on cost Petri net is developed. The proposed algorithm, which is different from the others, is to find the firing sequence of transitions by labeling places and increase flows in this sequence. Finally, an example is given to demonstrate the application of the algorithm. The results show that the given method can find the minimal cost maximal flow of a network efficiently.

scholarly journals Fuzzy Timing Petri Net for Fault Diagnosis in Power System

2012 ◽  
Vol 2012 ◽  
pp. 1-12 ◽  
Author(s):  
Alireza Tavakholi Ghainani ◽  
Abdullah Asuhaimi Mohd Zin ◽  
Nur ‘Ain Maiza Ismail
Keyword(s):  
Fault Diagnosis ◽  
Power System ◽  
Petri Net ◽  
Delay Time ◽  
Uncertain Information ◽  
Circuit Breakers ◽  
Inference Procedure ◽  
Use Of Time ◽  
Time Information ◽  
Firing Sequence

A model-based system for fault diagnosis in power system is presented in this paper. It is based on fuzzy timing Petri net (FTPN). The ordinary Petri net (PN) tool is used to model the protective components, relays, and circuit breakers. In addition, fuzzy timing is associated with places (token)/transition to handle the uncertain information of relays and circuits breakers. The received delay time information of relays and breakers is mapped to fuzzy timestamps,π(τ), as initial marking of the backward FTPN. The diagnosis process starts by marking the backward sub-FTPNs. The final marking is found by going through the firing sequence,σ, of each sub-FTPN and updating fuzzy timestamp in each state ofσ. The final marking indicates the estimated fault section. This information is then in turn used in forward FTPN to evaluate the fault hypothesis. The FTPN will increase the speed of the inference engine because of the ability of Petri net to describe parallel processing, and the use of time-tag data will cause the inference procedure to be more accurate.

Fault-tolerant tracking control of petri nets

2018 ◽  
Vol 66 (1) ◽  
pp. 30-40 ◽  
Author(s):  
Raphael Fritz ◽  
Ping Zhang
Keyword(s):  
Linear Programming ◽  
Petri Nets ◽  
Petri Net ◽  
Tracking Control ◽  
Fault Tolerant ◽  
Computational Effort ◽  
Control Approach ◽  
Sensor Actuator ◽  
Linear Programming Problems ◽  
Firing Sequence

Abstract In this paper, the fault-tolerant tracking control of petri nets is considered. The control aim is to steer a petri net in case of faults from an initial marking into a destination marking by an appropriate firing sequence. Sensor, actuator and process faults in the plant are modeled based on four types of faulty transitions. Depending on the characteristics of the faults, two approaches are proposed to handle the faults. The tracking control problem is realized by solving two integer linear programming problems. This two-step approach reduces the computational effort significantly. Faults are taken into account as constraints and by adapting the firing sequence. Finally, an example is given to illustrate the proposed fault-tolerant tracking control approach.

scholarly journals A Synthesis Method for Petri Net with Prescribed Firing Sequence

1985 ◽  
Vol 21 (3) ◽  
pp. 277-283 ◽  
Author(s):  
Kouji TAKAHASHI ◽  
Kensuke HASEGAWA ◽  
Zbigniew BANASZAK
Keyword(s):  
Petri Net ◽  
Synthesis Method ◽  
Firing Sequence
Sign in / Sign up

Export Citation Format

Share Document