{'fraction_non_alphanumeric': 0.0228310502283105, 'fraction_numerical': 0.0, 'mean_word_length': 5.450980392156863, '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}}
Verification of Business Processes with Time Constraints

While Business Process Modeling Notation (BPMN) provides us with the comprehensive capability to describe business processes (BPs) concisely, it is difficult to evaluate the resultant models, since few proof and simulation facilities are available in it. This problem becomes crucial when BPs include time constraints, since the behavior of them are much more complicated than ordinary BPs. This paper proposes a Colored Petri Net (CPN) based approach to evaluating time-dependent business processes. In this approach, BPMN models are converted to CPN model to evaluate the validity using CPN tools.