{'fraction_non_alphanumeric': 0.01891891891891892, 'fraction_numerical': 0.0, 'mean_word_length': 5.616071428571429, '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}}
Optimizing Business Processes through Parallel Task Execution

Optimization of business processes is a persistent topic and a key goal in business process management (BPM). In this work, we investigate how a given resource allocation in business processes can drive optimizations in an underlying BPMN diagram. More specifically, the main contribution is a proposal to leverage a variant of representation of processes as Refined Process Structure Trees (RPSTs) with a view to enabling novel resource allocation-driven task re-ordering in a principled manner. The re-orderings targeted enforce the parallelism redesign heuristic that allows for multiple resources operating concurrently, which yields improvements in the process cycle time.