Strongly Infinite-Step Opaque Boolean Networks

• 成果类型: Article
• 署名作者: Reveliotis, Spyros
• 署名单位: University System of Georgia; Georgia Institute of Technology
• 刊物名称: IEEE TRANSACTIONS ON AUTOMATIC CONTROL
• ISSN/ISSBN: 0018-9286
• DOI: 10.1109/TAC.2025.3586780
• 发表日期: 2025
• 关键词: Discrete-event systems; opacity; observability; STABILITY

摘要

Opacity is a concept that has been studied extensively by the discrete event systems (DES) community. This work specializes this concept to the semantics and the dynamics of autonomous Boolean networks (BNs), which constitute a DES subclass. Focusing on the particular notion of strong infinite-step opacity, this article provides customized, streamlined verification algorithms and novel enforcement methods. The underlying analysis also reveals the affinity of this concept to the existing results on BN observability, an extensively investigated property in the corresponding literature. Finally, this article also discusses the extension of this prototypical study to other versions of opacity that have been studied in the literature, and to more general versions of BNs and other logical networks.