{'fraction_non_alphanumeric': 0.02388535031847134, 'fraction_numerical': 0.0, 'mean_word_length': 5.836956521739131, '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}}
Observability of Boolean control networks with state-dependent input constraints

In this paper, under the framework of the semi-tensor product of matrices, the observability of Boolean control networks (BCNs) with state-dependent input constraints is investigated. In order to avoid unnecessary repeated computation, an algorithm is proposed to check the observability. Furthermore, more effective necessary and sufficient conditions for the observability of Boolean control networks with state-dependent input constraints have been derived. Finally, an example is given to illustrate the effectiveness of the obtained results.