Browsing by Subject "Np-hard"
Now showing items 1-1 of 1
-
Conference Object
Verification of K-step opacity and analysis of its complexity
(2009)In this paper, we analyze the verification of K-step opacity in discrete event systems that are modeled as (possibly non-deterministic) finite automata with partial observation on their transitions. A system is K-step ...