{'fraction_non_alphanumeric': 0.014705882352941176, 'fraction_numerical': 0.0, 'mean_word_length': 5.395973154362416, '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}}
Efficient Computations for Evaluating Extended Stochastic Petri Nets using Algebraic Operations

This paper presents an efficient method to evaluate the performance of an extended stochastic Petri net by simple algebraic operations. The reachability graph is derived from an extended stochastic Petri net, and then converted to a timed stochastic state machine, using a semi-Markov process. The n-th moments of the performance index are derived by algebraic manipulations with each of the n-th moments of transition time and transition probability. For the derivation, three reduction rules are introduced on the transition trajectories in a well- formed regular expression. Efficient computation algorithms are provided to automate the sug- gested method. The presented method provides a proficient means to derive both the numerical and the symbolic solutions for the performance of an extended stochastic Petri net by simple algebraic manipulations.