{'fraction_non_alphanumeric': 0.0347985347985348, 'fraction_numerical': 0.0, 'mean_word_length': 5.435294117647059, '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}}
An Efficient Method of Probabilistic Model Checking

A probabilistic system is useful in modeling randomized algorithms (e.g., consensus algorithms), unreliable or unpredictable behaviors (e.g., human behaviors in decision making process), etc. Markov Decision Process (MDP) is used to construct this kind of system, because it has both nondeterministic and probabilistic choices. In this work, we study probabilistic models and analyze some issues such as reachability and LTL model checking with some new methods in calculating the probability.