Browsing by Subject "System state"
Now showing items 1-7 of 7
-
Article
Bounds on the number of markings consistent with label observations in petri nets
(2009)In this paper, we consider state estimation in discrete-event systems (DESs) modeled by labeled Petri nets and present upper bounds on the number of system states (or markings) that are consistent with an observed sequence ...
-
Conference Object
Opacity verification in stochastic discrete event systems
(2010)Motivated by security and privacy considerations in applications of discrete event systems, various notions of opacity have been introduced. Specifically, a system is said to be current-state opaque if the entrance of the ...
-
Conference Object
Optimal sensor selection for structural observability in Discrete Event Systems modeled by Petri nets
(2007)This paper studies sensor selection problems in Discrete Event Systems modeled by Petri nets with outputs (i.e., Petri nets with both transition sensors and place sensors). The goal is to place sensors so as to maintain ...
-
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 ...
-
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 ...
-
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 ...