{'fraction_non_alphanumeric': 0.018036072144288578, 'fraction_numerical': 0.0, 'mean_word_length': 5.172839506172839, '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 Unified Approach to the Deadlock Detection Problem in Networks of Communicating Finite State Machines

We consider the deadlock detection problem (DDP) of networks of communicating finite state machines (NCFSMs). The DDP problem is known to be undecidable for NCFSMs. In this paper, we provide a characterization of those subclasses of networks for which the deadlock problem is decidable. We also provide a proof technique based on our characterization and illustrate our technique on an example.