{'fraction_non_alphanumeric': 0.0, 'fraction_numerical': 0.0, 'mean_word_length': 4.990990990990991, '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}}
Synthesizing a Global Net State from Synchronized Local Pieces

A traditional problem with state space analysis for concurrent systems has been the expo nential explosion in the size of the state space relative to the size of the system This explosion not only consumes an exponential amount of time in generating a state space but an exponen tial amount of storage space as well In this report we show a technique that attacks both the storage half and the time half of this problem A synchronous net set is a collection of Petri nets that together model a system of concurrent processes Rather than combine the process models into a large net for analysis we keep the nets separate and allow special transitions to synchronize their respective executions implicitly Analysis is done by computing and storing the state spaces for the individual nets and then virtually combining the state spaces when a system wide state query is performed This approach saves a large amount of storage space over using a global net state space and for certain conditions requires less time for querying the state space In addition it promotes modular models in that a change to one net model requires recomputation of only the corresponding relatively small individual state space rather than recomputation of the entire system wide state space