{'fraction_non_alphanumeric': 0.025757575757575757, 'fraction_numerical': 0.0, 'mean_word_length': 5.064220183486238, '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}}
Construction of the precedence graphs equivalent to a given set of assembly sequences

Precedence graphs are used in assembly systems design, tasks-to-workstations assignment algorithms and resource planning. Despite that, no systematic obtaining method for these graphs has been proposed. On the other hand, there are very efficient methods to generate assembly sequences and a precedence graph can be obtained by "merging" assembly sequences. In the paper, a property of a given set of assembly sequences is found, that guarantees the existence of an "equivalent" precedence graph. This result can be used for the general case, when this property is not met.