{'fraction_non_alphanumeric': 0.00975609756097561, 'fraction_numerical': 0.0, 'mean_word_length': 5.372670807453416, '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}}
Universitt at Dortmund Hierarchical Reachability Graph Generation for Petri Nets Hierarchical Reachability Graph Generation for Petri Nets

Reachability analysis is the most general approach to analyze Petri nets. Due to state space explosion , generation of the reachability set and reachability graph becomes intractable even for moderately sized nets with the known approaches. This paper presents a new method to generate and represent the reachability set and reachability graph of large Petri nets in a compositional and hierarchical way. The representation is related to previously known Kronecker based representations and it contains the complete information about reachable markings and possible transitions. The central idea of the new technique is a divide and conquer approach. Based on net-level results, nets are decomposed and reachability graphs for parts are generated and combined. The whole approach can be realized in a completely automated way and has been integrated in a Petri Net based analysis tool.