Opacity of discrete event systems and its applications

Abstract

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… (More)
DOI: 10.1016/j.automatica.2011.01.002

Topics

4 Figures and Tables

Statistics

0102020112012201320142015201620172018
Citations per Year

58 Citations

Semantic Scholar estimates that this publication has 58 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics