{'fraction_non_alphanumeric': 0.01958650707290533, 'fraction_numerical': 0.01088139281828074, 'mean_word_length': 5.618705035971223, '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}}
Verification of Asynchronous Systems with Unbounded and Unordered Message Buffers

We present algorithms for verifying safety and liveness properties of a class of systems, executing and communicating asynchronously. These systems will be modeled by a variant of finite state machines with unbounded and unordered message buffers, and hence will have an infinite state space. We present algorithms for deciding two weak preorder relations over such systems, namely language containment and generalized divergence language containment. This is in contrast to previous results that either decide equivalences between infinite state systems [25,7,29] or preorders between an infinite state system and a finite state system [2,1,6,13]. We also establish EXPSPACE lower bounds for the verification problems we investigate, and we show that our algorithms can be applied to decide the may testing equivalence on such systems.