{'fraction_non_alphanumeric': 0.027675276752767528, 'fraction_numerical': 0.0, 'mean_word_length': 5.241379310344827, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Deadlock avoidance policies for resource allocation systems with applications to FMS

The problem of deadlock avoidance for a class of resource allocation systems (RAS) called the single-unit RAS (SU-RAS) is discussed with particular application to buffer space allocation in a flexible manufacturing system. For a class of SU-RAS, it is shown that the problem of obtaining the maximally permissive deadlock avoidance policy is of polynomial complexity. Sub-optimal policies (which are not maximally permissive) for SU-RAS are also discussed.