{'fraction_non_alphanumeric': 0.02795698924731183, 'fraction_numerical': 0.0, 'mean_word_length': 4.81875, '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}}
The Analysis of Resource Constrained Workflows using Petri Nets

A workflow describes a complex process that takes place inside an organization. A workflow can be structured into several perspectives. In order to model both the process and the resouce perspective of workflows, a Petri net model based on nested Petri nets has been proposed: resource workflow nets (RWF-nets). Unlike other models, RWF-nets permit a clear distinction between the perspectives, modelling efficiently their interaction, and ensure the flexibility of the system. A case (or workflow instance) is the subject of the operations in the workflow. RWF-nets permit the handling of one case at a time. This paper extends the definition of RWF-nets in order to allow the handling of multiple cases at a time, defines a notion of behavioural correctness for RWF-nets, k-soundness, and proves the decideability of this property for a special class of RWF-nets.