{'fraction_non_alphanumeric': 0.011523687580025609, 'fraction_numerical': 0.0, 'mean_word_length': 4.969465648854962, '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}}
Erroneous state detection in piecewise FIFO system

Distributed systems normally use concurrent systems which communicate via unbounded FIFO channels. Despite well-known difficulties in analyzing such systems, they are of significant interest as they can describe a wide range of communication protocols. In this paper, we have studied the problem of computing the set of reachable states of a FIFO system composed of piecewise components. This problem is closely related to computing the set of all possible channel contents. For each control location which can be realized by the sequence diagrams produced by the SPIN. We present a model checking approach to find set of reachable states of FIFO channels via different paths in which some of the paths end in an erroneous state.