Abstract
Over the last two decades, a great deal of research has been focused on solving deadlock problems in resource allocation systems such as computer communication systems, workflow systems, and flexible manufacturing systems, resulting in a wide variety of approaches. As a well-defined problem in resource allocation systems, deadlock prevention based on a Petri net formalism has received an enormous amount of attention in the literature. This paper intends to review and compare a variety of Petri net-based deadlock prevention policies reported in the literature. Their comparison is done in terms of structural complexity, behavior permissiveness, and computational complexity. This paper should facilitate engineers in choosing a suited method for their industrial application cases.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 173-188 |
| Number of pages | 16 |
| Journal | IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews |
| Volume | 38 |
| Issue number | 2 |
| DOIs | |
| State | Published - Mar 2008 |
All Science Journal Classification (ASJC) codes
- Control and Systems Engineering
- Software
- Information Systems
- Human-Computer Interaction
- Computer Science Applications
- Electrical and Electronic Engineering
Keywords
- Computational complexity
- Deadlock prevention
- Flexible manufacturing system (FMS)
- Petri net