Efficient failure-recovering supervisors

Paape, N.; Mortel-Fronczak, J.M. van de; Swartjes, L.; Reniers, Michel A.

doi:10.1016/j.ifacol.2020.12.2311

Cited by 3 publications

(3 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Definition 4.2 (u − v−controllable reachability). Consider a system G in (16) with a set of secret states Q s , the (security) level sets Σ i (i ∈ [0, n − 1]) in (2), and let u ≥ 1, v ≥ 0, and Σ be a nonempty subset of Σ ≥v c in (17). We say that Q s is reachable with at least u controllable events of (security) level at least v w.r.t.…”

Section: Policy Computation For Uscpmentioning

confidence: 99%

“…, S u−1 for G (if they exist) as well as the minimum cost index i min . Each supervisor is computed by the UCC function (lines [14][15][16][17][18][19][20][21][22][23][24], and provides a different control policy such that every string reaching secret states has at least one controllable event of (security) level at v. So in total, S 0 , . .…”

Section: Policy Computation For Uscpmentioning

confidence: 99%

“…Another well studied problem is fault-tolerance and attack-resilience (e.g. [14,15,16,17,18]). This is a design requirement that a supervisory controller should remain (reasonably) operational even after faults occur in the system or the system is undre malicious attacks.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Usability Aware Secret Protection with Minimum Cost

Matsui

Cai

2021

Preprint

View full text Add to dashboard Cite

In this paper we study a cybersecurity problem of protecting system's secrets with multiple protections and a required security level, while minimizing the associated cost due to implementation/maintenance of these protections as well as the affected system usability. The target system is modeled as a discrete-event system (DES) in which there are a subset of marker states denoting the services/functions provided to regular users, a subset of secret states, and multiple subsets of protectable events with different security levels. We first introduce usability-aware cost levels for the protectable events, and then formulate the security problem as to ensure that every system trajectory that reaches a secret state contains a specified number of protectable events with at least a certain security level, and the highest usability-aware cost level of these events is minimum. We first provide a necessary and sufficient condition under which this security problem is solvable, and when this condition holds we propose an algorithm to solve the problem based on the supervisory control theory of DES. Moreover, we extend the problem to the case of heterogeneous secrets with different levels of importance, and develop an algorithm to solve this extended problem. Finally, we demonstrate the effectiveness of our solutions with a network security example.

show abstract

Section: Policy Computation For Uscpmentioning

confidence: 99%

Section: Policy Computation For Uscpmentioning

confidence: 99%

See 1 more Smart Citation

Usability Aware Secret Protection with Minimum Cost

Matsui

Cai

2021

Preprint

View full text Add to dashboard Cite

show abstract

Offline supervisory control synthesis: taxonomy and recent developments

Fokkink,

Goorden

2024

Discrete Event Dyn Syst

View full text Add to dashboard Cite

This paper surveys recent advances in supervisory control theory since its 30th anniversary in 2017. We performed a systematic literature search and selected 272 relevant papers, with a focus on automata-based approaches. These were fitted into coherent narratives, based in part on a taxonomy of supervisor synthesis methods. The obtained papers show the fast and vast progress of the field, where recent research covers a wide range of new synthesis optimization techniques, different aspects such as fault tolerance, security, and timing, and new and diverse application domains. This survey refrains from in-depth descriptions of techniques, instead focusing on high-level contributions of recent works, how they relate to each other, and future directions for research.

show abstract

Usability aware secret protection with minimum cost

Matsui

Cai

2021

Nonlinear Analysis: Hybrid Systems

View full text Add to dashboard Cite

Efficient failure-recovering supervisors

Cited by 3 publications

References 14 publications

Usability Aware Secret Protection with Minimum Cost

Usability Aware Secret Protection with Minimum Cost

Offline supervisory control synthesis: taxonomy and recent developments

Usability aware secret protection with minimum cost

Contact Info

Product

Resources

About