Two generalized-petri-net-based strategies for deadlock prevention in resource allocation systems

Hesuan Hu, Zhiwu Li, Mengchu Zhou

Research output: Contribution to journalConference articlepeer-review

Abstract

This paper considers the deadlock prevention problem for a class of conjunctive/disjunctive resource allocation systems (C/D-RAS) in which multiple resource acquisitions and flexible routings are allowed. The proposed policy is developed in a generalized Petri net framework by an iterative algorithm. Each iteration uses a mixed integer programming (MIP) formulation to find both a bad marking and insufficiently marked siphon. Two new strategies are then presented. One aims to maximize the permissiveness of a liveness-enforcing supervisor while another to minimize the computational and supervisor's complexity. Experimental results validate the effectiveness of these two strategies.

Original languageEnglish (US)
Article number4811575
Pages (from-to)1948-1953
Number of pages6
JournalConference Proceedings - IEEE International Conference on Systems, Man and Cybernetics
DOIs
StatePublished - Dec 1 2008
Event2008 IEEE International Conference on Systems, Man and Cybernetics, SMC 2008 - Singapore, Singapore
Duration: Oct 12 2008Oct 15 2008

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering
  • Control and Systems Engineering
  • Human-Computer Interaction

Keywords

  • Discrete event systems
  • Petri net
  • Resource allocation systems

Fingerprint Dive into the research topics of 'Two generalized-petri-net-based strategies for deadlock prevention in resource allocation systems'. Together they form a unique fingerprint.

Cite this