{'fraction_non_alphanumeric': 0.023391812865497075, 'fraction_numerical': 0.0, 'mean_word_length': 5.008771929824562, '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}}
Strategy-Based and Knowledge-Based Models of Information Flow: Equivalence and Decidability

We show that two notions of information flow, one which is strategy-based and the other knowledge-based, are equivalent. The first notion models the possibilities that a high-level user has to send information to the low-level user by distinctly observable runs, whereas the second notion models information leak as variations in the knowledge of the low-level user during his observation of the system behavior. We also give an algorithm for deciding whether a finite-state system has no information flow in our setting, by reducing the problem to a reachability problem in finite automata.