Opacity of discrete event systems and its applications

✍ Scribed by Feng Lin

• Publisher: Elsevier Science
• Year: 2011
• Tongue: English
• Weight: 369 KB
• Volume: 47
• Category: Article
• ISSN: 0005-1098
• DOI: 10.1016/j.automatica.2011.01.002

✦ Synopsis

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.