Browsing by Subject "Initial state"
Now showing items 1-8 of 8
-
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
Initial state opacity in stochastic des
(2013)A non-deterministic finite automaton is initial-state opaque if the membership of its true initial state to a given set of secret states S remains opaque (i.e., uncertain) to an intruder who observes system activity through ...
-
Conference Object
Opacity-enforcing supervisory strategies for secure discrete event systems
(2008)Initial-state opacity emerges as a key property in numerous security applications of discrete event systems including key-stream generators for cryptographic protocols. Specifically, a system is initial-state opaque if 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
Reduced-complexity verification for initial-state opacity in modular discrete event systems
(2010)In this paper, we propose and analyze reduced-complexity methodologies for verifying initial-state opacity in modular discrete event systems. Initial-state opacity requires that the membership of the system initial state ...
-
Conference Object
Resolution of initial-state in security applications of des
(2012)A non-deterministic labeled finite automaton is initial-state opaque if the membership of its true initial state to a set of secret states S remains opaque (i.e., uncertain) to an intruder who observes system activity ...
-
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 ...