Supervisory control of a class of discrete event processes
SIAM Journal on Control and Optimization
On observability of discrete-event systems
Information Sciences: an International Journal - Robotics and Automation/Control Series
Formulas for calculating supremal controllable and normal sublanguages
Systems & Control Letters
Crowds: anonymity for Web transactions
ACM Transactions on Information and System Security (TISSEC)
Why Event Observation: Observability Revisited
Discrete Event Dynamic Systems
Probabilistic analysis of an anonymity system
Journal of Computer Security - Special issue on CSFW15
Discrete Event Dynamic Systems
Opacity generalised to transition systems
International Journal of Information Security
State estimation and detectability of probabilistic discrete event systems
Automatica (Journal of IFAC)
Modelling Opacity Using Petri Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
Preserving secrecy under refinement
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Safe diagnosability for fault-tolerant supervision of discrete-event systems
Automatica (Journal of IFAC)
Comparative analysis of related notions of opacity in centralized and coordinated architectures
Discrete Event Dynamic Systems
| Hi-index | 22.15 |
In this paper, we investigate opacity of discrete event systems. We define two types of opacities: strong opacity and weak opacity. Given a general observation mapping, a language is strongly opaque if all strings in the language are confused with some strings in another language and it is weakly opaque if some strings in the language are confused with some strings in another language. We show that security and privacy of computer systems and communication protocols can be investigated in terms of opacity. In particular, two important properties in security and privacy, namely anonymity and secrecy, can be studied as special cases of opacity. We also show that by properly specifying the languages and the observation mapping, three important properties of discrete event systems, namely observability, diagnosability, and detectability, can all be reformulated as opacity. Thus, opacity has a wide range of applications. Also in this paper we provide algorithms for checking strong opacity and weak opacity for systems described by regular languages and having a generalized projection as the observation mapping.