{'fraction_non_alphanumeric': 0.026244343891402715, 'fraction_numerical': 0.0036199095022624436, 'mean_word_length': 5.703030303030303, '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}}
Error‐preserving local transformations on communication protocols

Recently, two transformations were proposed for modifying a member of a closed system of communicating state machines (CSMs) without considering the other CSMs and nevertheless securing that after the modification, the system can reach the same dead states and overfill the same channels, where channels are assumed to be error‐free unidirectional first‐in‐first‐out queues. When verifying the general correctness properties of a communication protocol whose specification is such a system, one can employ the two error‐preserving local transformations (EPLTs) for simplifying individual CSMs and thereby the subsequent reachability analysis. The paper proves four new simple EPLTs and a generic EPLT which strongly generalizes all the six EPLTs and from which further easily applicable EPLTs can be derived simply by specialization. For each of the EPLTs, it also discusses how (non‐)executability of CSM transitions in the new system version reflects (non‐)executability of those in the old one. Copyright © 2011 John Wiley & Sons, Ltd.