{'fraction_non_alphanumeric': 0.012552301255230125, 'fraction_numerical': 0.0, 'mean_word_length': 5.468468468468468, '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}}
Matrix Approach to Pattern-type Reachability Analysis of Fractal Petri nets

Pattern-type reachability analysis extends Petri nets analysis by constructing a reachability graph from the patterns which are the internal emergent properties of the modeling system. The process construction of the reachability tree takes into account Place and Transition invariants. Vertices of the pattern are markings satisfy a some set of constraints. The elastic model of the Dinning Philosophers based on Fractal Petri nets and its pattern-type analysis are considered. Fractal algebra operations implements by matrix operations. It makes possible to consider a state space explosion problem as patterns emergency and reachability.