1 November 2020 in Systems & Control Letters
6 June 2024 in IEEE Transactions on Cybernetics
Stability maintenance in systems refers to the capacity to preserve inherent stability characteristics. In this article, stability maintenance of large boolean networks (BNs) subjected to perturbations is investigated using a distributed pinning control (PC) strategy. The concept of edge removal as a form of perturbation is introduced, and several criteria for achieving global stability are established. Two forms of distributed PCs, one implemented before perturbation occurs and the other after, are introduced. It is noteworthy that the designs of the controllers are solely dependent on the system’s in-neighbors. The proposed method significantly decreases the computational complexity, reducing it from $O(2^{2|\texttt {V}|})$ to $O(|\texttt {V}|+ |\texttt {E}| + \kappa \cdot 2^{K})$ , where $|\texttt {V}|, |\texttt {E}|$ denotes the cardinality of vertices and arcs of the adjacent graph of BN, $\kappa $ is the number of the pinning nodes, and K represents the maximum in-degree of the network. In the worst-case scenario, the computational complexity is bounded by $O(|\texttt {V}|+ |\texttt {E}| + \kappa \cdot 2^{|\texttt {V}|})$ . To validate the effectiveness of the proposed methods, results from multiple gene networks are presented, including a model representing the human rheumatoid arthritis synovial fibroblast, among which only 12 of the 359 nodes are deemed essential.
23 August 2023 in IEEE Transactions on Automatic Control
This paper investigates the enforcement of (current-state) opacity, an important information-flow security property, via insertion functions. An insertion function is an obfuscation mechanism that inserts fictitious events to the outputs in order to confuse the outside observer (intruder) such that the secret of the system is not revealed. In some situations, the secret may be revealed when the insertion mechanism is (or becomes) publicly known. This leads to the problem of synthesizing private-and-public enforcing (PP-enforcing) insertion functions in the sense that opacity is still enforced even when the mechanism is discovered or published by the designer. Existing works that have investigated this synthesis problem are either only sound or have limited applicability as we show in this work. For this reason, and more importantly, to better solve the synthesis problem, a new approach is proposed upon an improved greedy criterion. We show that the proposed algorithm is both sound and complete, and can be used to completely solve the synthesis problem for the PP-enforcing insertion function. With slight modifications of our algorithm, infinite-step opacity and $ K$ -step opacity can also be enforced under publicly-known insertion mechanisms.
8 November 2022 in IEEE Transactions on Automatic Control
The enforcement of opacity, a security property concerning information-flow, has been investigated using edit functions, which are capable of manipulating the output of the system via insertion, replacement, and erasure operations on its symbols, in order to ensure that an outside observer (the intruder) does not gain access to critical system information. In this article, we consider situations where an intended receiver may be present and develop attribute-based edit functions, which not only obfuscate the output for the intruder, but also allow the intended receiver (who is assumed to have access to specific additional information) to recover the original output behavior. In our developed edit mechanism, edit functions modify the output by only performing insertion or replacement operations under a carefully chosen replacement regulation. Moreover, the outside observer that satisfies the intended-receiver attribute (i.e., the identity of the observer is the intended receiver) is able to recover the unedited output sequence using its ability to distinguish inserted/replaced symbols, and its knowledge of the replacement regulation. We provide an algorithmic procedure, based on a backtracking technique, to obtain suitable replacement regulations for the attribute-based edit function and the intended receiver.
10 June 2020 in Circuits, Systems, and Signal Processing
5 May 2025 in IEEE Transactions on Automatic Control
In this article, we investigate the synthesis problem of edit functions for opacity enforcement in systems modeled as partially observed finite-state automata. For better plausible deniability for the edit functions, in cases where the intruder may learn/know their existence, a synthesis problem for nondeterministic edit functions under a publicly known setting was introduced in the literature, but not yet fully solved. In light of this, we revisit the publicly known edit mechanism by proposing a sound and complete approach for solving the synthesis problem of nondeterministic publicly known edit functions. For practical applications, the edit function is assumed to have limited erasure and insertion ability. Our approach is based on a new labeled finite-state structure, and results in wider applicability than previously-proposed in the literature.