Browsing by Subject "Partial observation"
Now showing items 1-8 of 8
-
Article
Coverage analysis of mobile agent trajectory via state-based opacity formulations
(2011)This paper performs coverage analysis of mobile agent trajectory utilizing discrete event system models and employing state-based notions of opacity. Non-deterministic finite automata with partial observation on their ...
-
Article
Fault diagnosis in discrete event systems modeled by partially observed petri nets
(2009)In this paper, we study fault diagnosis in discrete event systems modeled by partially observed Petri nets, i.e., Petri nets equipped with sensors that allow observation of the number of tokens in some of the places and/or ...
-
Article
Supervisor synthesis for discrete event systems under partial observation and arbitrary forbidden state specifications
(2014)In this paper, we consider the forbidden state problem in discrete event systems modeled by partially observed and partially controlled Petri nets. Assuming that the reverse net of the uncontrollable subnet of the Petri ...
-
Conference Object
Verification of infinite-step opacity and analysis of its complexity
(2009)In this paper, we formulate, analyze, and devise methodologies to verify the notion of infinite-step opacity in discrete event systems that are modeled as (possibly non-deterministic) finite automata with partial observation ...
-
Article
Verification of infinite-step opacity and complexity considerations
(2012)We describe and analyze the complexity of verifying the notion of infinite-step opacity in systems that are modeled as non-deterministic finite automata with partial observation on their transitions. Specifically, a system ...
-
Article
Verification of initial-state opacity in security applications of discrete event systems
(2013)In this paper, we formulate and analyze methodologies for verifying the notion of initial-state opacity in discrete event systems that are modeled as non-deterministic finite automata with partial observation on their ...
-
Article
Verification of K-step opacity and analysis of its complexity
(2011)Motivated by security and privacy considerations in a variety of applications of discrete event systems, we describe and analyze the computational complexity required for verifying the notion of K-step opacity for systems ...
-
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 ...