Dynamic Observers for the Synthesis of Opaque Systems
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Automatic Testing of Access Control for Security Properties
TESTCOM '09/FATES '09 Proceedings of the 21st IFIP WG 6.1 International Conference on Testing of Software and Communication Systems and 9th International FATES Workshop
Verification and synthesis for secrecy in discrete-event systems
ACC'09 Proceedings of the 2009 conference on American Control Conference
Opacity of discrete event systems and its applications
Automatica (Journal of IFAC)
Synthesis of opaque systems with static and dynamic masks
Formal Methods in System Design
Verification of initial-state opacity in security applications of discrete event systems
Information Sciences: an International Journal
Comparative analysis of related notions of opacity in centralized and coordinated architectures
Discrete Event Dynamic Systems
| Hi-index | 0.00 |
Given a finite state system with partial observers and for each observer, a regular set of trajectories which we call a secret, we consider the question whether the observers can ever find out that a trajectory of the system belongs to some secret. We search for a regular control on the system, enforcing the specified secrets on the observers, even though they have full knowledge of this control. We show that an optimal control always exists although it is generally not regular. We state sufficient conditions for computing a finite and optimal control of the system enforcing the concurrent secret as desired.