{'fraction_non_alphanumeric': 0.014492753623188406, 'fraction_numerical': 0.0, 'mean_word_length': 5.213483146067416, '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}}
From Petri Nets to Graph Transformation Systems

Hans-Joerg Kreowski was among the first researchers to point out that Place/Transition Petri nets can be interpreted as instances of Graph Transformation Systems, a fact now considered folklore. 
 We elaborate on this observation, discussing how several different models of Petri nets can be encoded faithfully into Graph Transformation Systems. The key idea we pursue is that the net encoding is uniquely determined, and distinct net models are mapped to alternative approaches to graph transformation.