文件名称:representations
介绍说明－－下载内容均来自于网络，请自行研究使用
The paper deals with representations of the safe states set in the Banker s problem. Using a Petri
Net model we derive formulas for this set (SAFE) directly and for its (smaller) minimal elements
set MIN. Moreover, we partition the set MIN into subclasses, so that two elements of the same
subclass only differ by the permutation of their components. The set SORT, which contains only
one representend of each subclass, is an even smaller representation of the safe states. We also
derive estimates for the size of SORT. Finally we investigate, how our results can be translated to
the multidimensional Banker s Problem, where credits in more than one currency can be given
Net model we derive formulas for this set (SAFE) directly and for its (smaller) minimal elements
set MIN. Moreover, we partition the set MIN into subclasses, so that two elements of the same
subclass only differ by the permutation of their components. The set SORT, which contains only
one representend of each subclass, is an even smaller representation of the safe states. We also
derive estimates for the size of SORT. Finally we investigate, how our results can be translated to
the multidimensional Banker s Problem, where credits in more than one currency can be given
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Banker's Algorithm3.pdf