{'fraction_non_alphanumeric': 0.010282776349614395, 'fraction_numerical': 0.0, 'mean_word_length': 5.491666666666666, '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}}
Optimization in Graph Transformation Systems Using Petri Net Based Techniques

The design of business or production systems frequently necessitates to simultaneously fulfill several logical and numerical constraints as requirements in order to deliver a functionally correct and optimal system. Such a problem can be typically formulated as a combined optimization and reachability analysis. In the current paper, we show how this problem can be formalized when the evolution of the system is captured by graph transformation systems (GTS) with a cost parameter attached to each graph transformation rule denoting the cost of firing the rule. Furthermore, we discuss how to solve such problems by combining guided state space exploration with algebraic techniques of Petri nets.