{'fraction_non_alphanumeric': 0.018001800180018002, 'fraction_numerical': 0.0, 'mean_word_length': 5.579881656804734, '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}}
Deadlock-free verification and performance enhancement of RosettaNet PIPs with time Petri nets

This paper deals with the deadlock-free verification problem of RosettaNet, a promising and widespread e-business protocol in the information technology and electronic industries. RosettaNet PIPs (partner interface processes) specifications are first modelled with time Petri nets (TPNs) which allow an explicit modelling of concurrency and parallelism. Correctness of the TPN models is verified to ensure the capability of deadlock-freeness, auto-repairing implementation of RosettaNet applications. We adopt the idea of checking the possible existence of an uncontrolled siphon as our deadlock detection mechanism. We demonstrate that RosettaNet PIPs are deadlock-free in both deterministic and stochastic operational environments. A patch subnet technique is developed to improve the efficiency of RosettaNet PIPs. We also prove that the execution of some steps defined in RosettaNet PIPs will never take place. We therefore suggest to removing these unnecessary steps from RosettaNet PIPs and from a lean model.