{'fraction_non_alphanumeric': 0.018361581920903956, 'fraction_numerical': 0.0, 'mean_word_length': 5.330357142857143, '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}}
On the reachability of a class of continuous bilinear systems

Abstract It is well known that using differential geometric methods, the reachability of nonlinear systems can be checked via Lie algebra. Normally, the resultant checking condition is state dependent and requires complicated recursive Lie bracket operations. In this paper, it is shown that for dyadic bilinear systems, the reachability property is actually state independent, and hence a global property of the system. Specifically, it is proved that the Lie algebra condition is equivalent to the rank conditions of two constant matrices. As examples, the reachability of two real‐world systems is examined through the new checking condition.