Design of River System Deadlock Avoidance Supervisor by Using Petri Net

• Published in: Promet Vol. 22; no. 3; pp. 175 - 182
• Main Authors: Danko Kezić, Anita Gudelj
• Format: Journal Article
• Language: English
• Published: University of Zagreb, Faculty of Transport and Traffic Sciences 01.01.2010
• Subjects: deadlock avoidance; discrete event system; Petri net; traffic management system
• ISSN: 0353-5320; 1848-4069
• DOI: 10.7307/ptt.v22i3.273

Advanced function of the computer-based river traffic management system should automatically predict and prevent possible conflict and deadlock states between vessels by using adequate control policy (supervisor). This paper proposes a formal method for calculating maximally permissive deadlock prevention supervisor. To model the river system, the authors use a class of Petri net suitable for describing multiple re-entrant flowlines with disjoint sets of resources, jobs and control places, and matrix-based formal method to analyze the system. By using matrix algebra, the structural characteristics of the Petri net (circular waits, P-invariants, critical siphons and subsystem, key resource) have been analyzed and the steps for supervisor design proposed. The first and the second level deadlocks can be avoided by maintaining the number of tokens in the critical subsystems and ensuring that the key resource would not be the last available resource in the system. The derived supervisor has been verified by a computer simulation using MATLAB environment. KEYWORDS: traffic management system, deadlock avoidance, discrete event system, Petri net