Automated Synthesis of Deadlock Prevention Supervisors Using Petri Nets

@inproceedings{Iordache2000AutomatedSO,
  title={Automated Synthesis of Deadlock Prevention Supervisors Using Petri Nets},
  author={Marian V. Iordache and John O. Moody and Panos J. Antsaklis},
  year={2000}
}
Given an arbitrary Petri net structure, which may have uncontrollable and unobservable transitions, the deadlock prevention procedure presented here determines a set of linear inequalities on the marking of a Petri net. When the Petri net is supervised so that its markings satisfy these inequalities, the supervised net is proved to be deadlock-free for all initial markings that satisfy the supervision constraints. Deadlock-freedom implies that there will always be at least one transition that… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 31 references

Deadlock Avoidance in FMS Based on Structural Theory of Petri Nets,

K. Barkaoui, I. Abdallah
IEEE Symposium on Emerging Technologies and Factory Automation • 1995
View 5 Excerpts
Highly Influenced

Petri Nets: Properties, Analysis and Applications,

T. Murata
in Proc. of the IEEE, • 1989
View 5 Excerpts
Highly Influenced

Deadlock Prevention in Discrete Event Systems Using Petri Nets, Master’s Thesis, University of Notre Dame

M. Iordache
1999

Analysis of Deadlocks and Circular Waits Using a Matrix Model for Discrete Event Systems,

F Lewis, H. Huang, D. Tacconi, A. Gürel, O. Pastravanu
1998

Similar Papers

Loading similar papers…