{'fraction_non_alphanumeric': 0.02822085889570552, 'fraction_numerical': 0.0, 'mean_word_length': 5.580645161290323, '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}}
Reduced Complexity Verification of Almost-Infinite-Step Opacity in Stochastic Discrete-Event Systems*

The analysis of infinite-step opacity in the context of stochastic discrete-event systems has been investigated as almost-infinite-step opacity for quantitative purposes. In this paper, we revisit the verification problem for almost-infinite-step opacity by concentrating on reducing its computational complexity. One of the key steps in the verification of almost-infinite-step opacity is the recognition of the unsafe language for infinite-step opacity. Inspired by recently developed techniques in the literature, we present an improved methodology for the calculation of the unsafe language for infinite-step opacity, which further improves the complexity of the verification of almost-infinite-step opacity.