{'fraction_non_alphanumeric': 0.020319303338171262, 'fraction_numerical': 0.0, 'mean_word_length': 5.571428571428571, '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}}
Matrix-based conflict resolution algorithm: Application to path selection in PN-based scheduling search

This paper presents an algorithm that selects a group of independent events out of a given set of possibly conflicting actions. The procedure is matrix-based and was implemented in JAVA to guide backtracking scheduling search based on a Petri Net-derived model of flow. The manufacturing systems particularly addressed in the implementation are using Web Services to implement the Service-Oriented-Architecture pattern. However, the conflict resolution method is applicable to more general settings, provided that conflicts are automatically detectable and expressible in matrix-form.