{'fraction_non_alphanumeric': 0.014771048744460856, 'fraction_numerical': 0.0, 'mean_word_length': 4.844827586206897, '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 Boolean Model for a Class of Discrete Event Systems

A Boolean matrix equation model is obtained for a class of discrete event systems in which the state change associated with each event occurrence is deterministic, and in which all entities are permanent. The Boolean matrix equations are quite compact and can be efficiently programmed on a digital computer. A conveyor system is used as an example. The model can be investigated for determinacy, zero states, and cycles. Algorithms are presented that determine whether transient events interact, and whether transient cycles exist. The zero states of a model are shown to be solutions of a simple Boolean matrix equation.