{'fraction_non_alphanumeric': 0.014184397163120567, 'fraction_numerical': 0.0, 'mean_word_length': 5.420454545454546, '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}}
An Automated Approach in Reverse Engineering Java Applications Using Petri Nets

In this paper, we propose a new approach for reverse engineering Java applications into Petri Net structures. Our approach rests on utilizing the foundations of Petri Nets as a means of uncovering certain attributes of interests. Petri Nets offers techniques of predicting path execution, flow complexity, dead paths, and resource utilization. The conclusion of this work will provide the strengths and weaknesses of using this approach along with future recommendations of research.