{'fraction_non_alphanumeric': 0.013282732447817837, 'fraction_numerical': 0.0, 'mean_word_length': 5.518518518518518, '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}}
Generalization of probabilistic scheduling models for realizing URLLC applications

In this paper, we mathematically generalize probabilistic Grant Free (GF) scheduling models so that they can be easily extended to deal with various problems in URLLC use cases. To demonstrate the extensibility of the generalized models, we introduce the reliability parameter α to the models and show that the extended models can be more rigorous against failure scenarios, which provides more flexible options in the design of GF scheduling.