{'fraction_non_alphanumeric': 0.025796661608497723, 'fraction_numerical': 0.0, 'mean_word_length': 5.0, '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}}
Knitting technique with TP-PT generations for Petri net synthesis

The knitting technique developed by the authors contains some simple but effective rules which can guide the synthesis of Petri nets (PNs) with the well-behaved properties such as liveness, boundedness, and reversibility, preserved automatically. The previous knitting technique admits only TT generations among sequential or concurrent processes and PP generations among sequential or exclusive processes. The TP- and PT-path generations are more complicated than the generation of TT- or PP-paths. This paper deals with the problem of how to set up the method of TP- or PT-path generations.