{'fraction_non_alphanumeric': 0.01845018450184502, 'fraction_numerical': 0.0, 'mean_word_length': 5.033333333333333, '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}}
Decomposition and reduction of packet set

Packet set is a set pair which is composed of the internal and outer packet set together. In this paper using the concepts and structures of packet set, we give several new concepts, such as decomposition class, reduction class, decomposition base, reduction base and so on. We further put forward decomposition and reduction theorem, the maximal and minimal attribute set principles. Decomposition and reduction of packet set are the theoretical base in the research of reasoning in dynamic system.