{'fraction_non_alphanumeric': 0.011286681715575621, 'fraction_numerical': 0.0, 'mean_word_length': 5.7272727272727275, '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}}
Reversing graph transformations

In recent work with Vincent Danos and Jean Krivine the author introduced a general framework for backtracking in concurrent formalisms, thus allowing modelling of situations where deadlock can arise without the necessity of explicitly encoding the often involved backtracking mechanisms. Here we shall discuss how the framework can be applied to the well-known formalism of double-pushout graph transformation.