{'fraction_non_alphanumeric': 0.0218408736349454, 'fraction_numerical': 0.0, 'mean_word_length': 4.944444444444445, '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 New Approach to Determine the Critical Path in Stochastic Activity Network

The determination of the Critical Path (CP) in stochastic networks has being a hard work, it is because of path durations are random variables and the selection of the critical path in the network causes probability problems. In this study, the authors have given a new definition on the CP in stochastic network and developed a modified Label-Correcting Tracing Algorithm (LCTA) to solve it. Based on the numerical results, as compared with Monte Carlo Simulation (MCS), it is proved that the proposed approach can accurately solve the CP in stochastic networks.