{'fraction_non_alphanumeric': 0.01301775147928994, 'fraction_numerical': 0.0, 'mean_word_length': 5.609375, '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}}
Secure Control Under Linear Temporal Logic Constraints

Cyber-physical systems must satisfy performance and safety criteria in spite of malicious attacks. In this paper, we investigate the problem of automatically synthesizing a control policy that maximizes the probability of satisfying safety and liveness constraints modeled using Linear Temporal Logic in the presence of an adversary. We develop a Stackelberg game framework, in which the controller chooses a probabilistic policy and the adversary chooses an attack strategy based on observation of that policy. We prove that maximizing the probability of satisfying safety and liveness constraints in this framework is equivalent to a worst-case reachability problem, and propose polynomial-time algorithms for computing the optimal policy. We illustrate our approach via numerical study.