Robustness of deadlock avoidance algorithms for sequential processes

Authors:
Fu-Shiung Hsieh
Affiliations:
Overseas Chinese Institute of Technology, 100 Chiao-Kwang Road, Taichung, Taiwan
Venue:
Automatica (Journal of IFAC)
Year:
2003

Citing 2
Cited 3

Necessary and sufficient conditions for deadlock-free operation inflexible manufacturing systems using a colored Petri net model

IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Comparing digraph and Petri net approaches to deadlock avoidance inFMS

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Context-aware workflow management based on formal knowledge representation models

ICCCI'10 Proceedings of the Second international conference on Computational collective intelligence: technologies and applications - Volume Part II
Robustness analysis of Petri nets for assembly/disassembly processes with unreliable resources

Automatica (Journal of IFAC)
Robustness of deadlock control for a class of Petri nets with unreliable resources

Information Sciences: an International Journal

Quantified Score

Hi-index	22.15

Visualization

Abstract

Although deadlock avoidance issue has attracted much attention and has been extensively studied, most of the existing results assume reliable machines. This assumption makes it difficult to apply existing deadlock avoidance algorithms to real manufacturing systems with unreliable machines. This paper presents the results to apply an existing deadlock avoidance algorithm to systems with unreliable machines by analyzing the robustness of the deadlock avoidance algorithm. Sequential production processes are considered in this paper, and Petri Net is adopted as the tool for modeling and analysis of the sequential processes. Different types of tolerable machine failures under which liveness property can be preserved are characterized. Computational complexity of the proposed algorithm is analyzed.