This work addresses the problem of protecting multiple global secrets in discrete event systems modeled by nondeterministic finite automata. Specifically, a global secret in a system is assumed to be composed of one or more states, each assigned a specific security level. We say that a state is protected if any sequence of events leading to it from the initial state contains a quantity of protected events that is equal to or greater than the required security level. Correspondingly, a global secret is said to be protected if the cumulative weight of its containing protected states (or all containing states are considered in the worst-case scenario) satisfies a user-defined protection threshold. Our objective is to develop an event protection policy that is capable of protecting global secrets. To do so, we build an augmented automaton which eliminates the difficulty of analyzing the infinite sequences when verifying protection. Then, an optimal protection policy with minimum cost can be obtained by solving an integer linear programming problem. Examples are given to illustrate the effectiveness of our proposed protection strategy.
Multiple Global Secrets Protection in Discrete Event Systems via Integer Linear Programming / Liu, R., Duan, W., Hu, S., Mangini, A.M., Fanti, M.P.. - (2026), pp. 3609-3614. (2026 American Control Conference, ACC 2026 usa 2026).
Multiple Global Secrets Protection in Discrete Event Systems via Integer Linear Programming
Liu R.;Duan W.;Hu S.;Mangini A. M.;Fanti M. P.
2026
Abstract
This work addresses the problem of protecting multiple global secrets in discrete event systems modeled by nondeterministic finite automata. Specifically, a global secret in a system is assumed to be composed of one or more states, each assigned a specific security level. We say that a state is protected if any sequence of events leading to it from the initial state contains a quantity of protected events that is equal to or greater than the required security level. Correspondingly, a global secret is said to be protected if the cumulative weight of its containing protected states (or all containing states are considered in the worst-case scenario) satisfies a user-defined protection threshold. Our objective is to develop an event protection policy that is capable of protecting global secrets. To do so, we build an augmented automaton which eliminates the difficulty of analyzing the infinite sequences when verifying protection. Then, an optimal protection policy with minimum cost can be obtained by solving an integer linear programming problem. Examples are given to illustrate the effectiveness of our proposed protection strategy.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


