Algebraic synthesis of efficient deadlock avoidance policies for sequential resource allocation systems

Cited 86 time in webofscience Cited 90 time in scopus
  • Hit : 239
  • Download : 0
Deadlock avoidance in sequential resource allocation systems is a well-defined problem in discrete event system Literature, as it underlies the operation of many contemporary technological systems. In the past, the problem has been studied by means of a number of formal frameworks, including the finite-state automata (FSA) and Petri nets (PN's). In this paper, it is shown that a significant class of deadlock avoidance policies (DAP's), known as algebraic polynomial kernel (PK)-DAP's, originally developed in the FSA paradigm, can be analyzed using recent results from PN structural analysis. Furthermore, the approach to DAP analysis and design taken in this paper has led to the effective generalization of the currently available algebraic PK-DAP's, and to their enrichment with new and more flexible policy implementations.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date
2000-04
Language
English
Article Type
Article
Keywords

FLEXIBLE MANUFACTURING SYSTEMS; PETRI NETS

Citation

IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, v.16, no.2, pp.190 - 195

ISSN
1042-296X
DOI
10.1109/70.843175
URI
http://hdl.handle.net/10203/72576
Appears in Collection
RIMS Journal Papers
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 86 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0