{'fraction_non_alphanumeric': 0.0242152466367713, 'fraction_numerical': 0.0, 'mean_word_length': 5.413793103448276, '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}}
A (Timed) State-Transition Semantics for Reflective Petri Nets

The design of dynamic (adaptable) discrete-event systems calls for adequate modeling formalisms and tools able to manage possible changes occurring during systempsilas lifecycle. A common approach is to pollute design with details that do not regard the current system behavior, rather its evolution. That hampers analysis, reuse and maintenance in general. A Petri net-based reflective model (based on classical Petri nets) was recently proposed to support dynamic discrete-event systempsilas design, and was applied to dynamic workflowpsilas management. Behind there is the idea that keeping functional aspects separated from evolutionary ones, and applying evolution to the (current) system only when necessary, results in a simple formal model on which the ability of verifying properties typical of Petri nets is preserved. On the perspective of implementing in the short time a discrete-event simulation engine, Reflective Petri nets are provided in this paper with a timed state-transition graph semantics, defined in terms of a Markov process.