{'fraction_non_alphanumeric': 0.033106134371957155, 'fraction_numerical': 0.0, 'mean_word_length': 5.155688622754491, '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}}
PEG: FORMALIZING LP-BASED MODELING OF PARALLEL DISCRETE-EVENT SIMULATION

Logical process (LPs) is a widely used modeling paradigm in parallel discrete-event simulation (PDES). However, there is a lack of effective methods for formalizing the LP-based modeling of PDES. This situation obstructs the unambiguous and platform-independent description of the LP-based model. To solve this problem, in this work, a formalism named Partitioned Event Graph (PEG) is presented. PEG is an extension to the classical Event Graph formalism, towards the formal specification of the LP-based models in PDES. We construct a mapping between PEG and LP-based models, and define the Structural Operational Semantics(SOS) of PEG on Timed-Transition System. Finally, the Wallclock Time based Execution is discussed. PEG formally specifies the event scheduling and the state partition properties of the LP paradigm, and thus provides modelers with a mean for cross platform model transformation and formal analysis to the model’s behavior in PDES.