{'fraction_non_alphanumeric': 0.025039123630672927, 'fraction_numerical': 0.003129890453834116, 'mean_word_length': 4.423728813559322, '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}}
BUCKER 2.0: An Unfolding Based Checker for CTL

There is a state space explosion problem for the traditional methods of computation tree logic(CTL) model checking, which are based on reachability graph. The unfolding technique of Petri nets can avoid/alleviate this problem. Based on the unfolding of Petri nets, we develop a model checker BUCKER. In the current version, it can check CTL based on the finite complete prefix (FCP) of an unfolding. One important step of checking CTL is to compute the cuts including a set of given places in the FCP. We propose a new method to compute them based on the maximal cliques in the graph theory.