Browsing by Author "Saboori, A."
Now showing items 113 of 13

Article
Coverage analysis of mobile agent trajectory via statebased opacity formulations
Saboori, A.; Hadjicostis, Christoforos N. (2011)This paper performs coverage analysis of mobile agent trajectory utilizing discrete event system models and employing statebased notions of opacity. Nondeterministic finite automata with partial observation on their ...

Article
Currentstate opacity formulations in probabilistic finite automata
Saboori, A.; Hadjicostis, Christoforos N. (2014)A system is said to be currentstate opaque if the entrance of the system state to a set of secret states remains opaque (uncertain) to an intruder  at least until the system leaves the set of secret states. This notion ...

Conference Object
Notions of security and opacity in discrete event systems
Saboori, A.; Hadjicostis, Christoforos N. (2007)In this paper, we follow a statebased approach to extend the notion of opacity in computer security to discrete event systems. A system is (S, P)opaque if the evolution of its true state through a set of secret states S ...

Conference Object
Opacity verification in stochastic discrete event systems
Saboori, A.; Hadjicostis, Christoforos N. (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 currentstate opaque if the entrance of the ...

Conference Object
Opacityenforcing supervisory strategies for secure discrete event systems
Saboori, A.; Hadjicostis, Christoforos N. (2008)Initialstate opacity emerges as a key property in numerous security applications of discrete event systems including keystream generators for cryptographic protocols. Specifically, a system is initialstate opaque if the ...

Article
Opacityenforcing supervisory strategies via state estimator constructions
Saboori, A.; Hadjicostis, Christoforos N. (2012)Statebased notions of opacity, such as initialstate opacity and infinitestep opacity, emerge as key properties in numerous security applications of discrete event systems. We consider systems that are modeled as partially ...

Conference Object
Reducedcomplexity verification for initialstate opacity in modular discrete event systems
Saboori, A.; Hadjicostis, Christoforos N. (2010)In this paper, we propose and analyze reducedcomplexity methodologies for verifying initialstate opacity in modular discrete event systems. Initialstate opacity requires that the membership of the system initial state ...

Conference Object
Verification of infinitestep opacity and analysis of its complexity
Saboori, A.; Hadjicostis, Christoforos N. (2009)In this paper, we formulate, analyze, and devise methodologies to verify the notion of infinitestep opacity in discrete event systems that are modeled as (possibly nondeterministic) finite automata with partial observation ...

Article
Verification of infinitestep opacity and complexity considerations
Saboori, A.; Hadjicostis, Christoforos N. (2012)We describe and analyze the complexity of verifying the notion of infinitestep opacity in systems that are modeled as nondeterministic finite automata with partial observation on their transitions. Specifically, a system ...

Conference Object
Verification of initialstate opacity in security applications of DES
Saboori, A.; Hadjicostis, Christoforos N. (2008)Motivated by security applications where the initial state of a system needs to be kept secret (opaque) to outside observers (intruders), we formulate, analyze and verify the notion of initialstate opacity in discrete ...

Article
Verification of initialstate opacity in security applications of discrete event systems
Saboori, A.; Hadjicostis, Christoforos N. (2013)In this paper, we formulate and analyze methodologies for verifying the notion of initialstate opacity in discrete event systems that are modeled as nondeterministic finite automata with partial observation on their ...

Conference Object
Verification of Kstep opacity and analysis of its complexity
Saboori, A.; Hadjicostis, Christoforos N. (2009)In this paper, we analyze the verification of Kstep opacity in discrete event systems that are modeled as (possibly nondeterministic) finite automata with partial observation on their transitions. A system is Kstep ...

Article
Verification of Kstep opacity and analysis of its complexity
Saboori, A.; Hadjicostis, Christoforos N. (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 Kstep opacity for systems ...