Browsing by Subject "Nondeterministic finite automaton"
Now showing items 114 of 14

Article
Coverage analysis of mobile agent trajectory via statebased opacity formulations
(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
(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
Decentralized state estimation in discrete event systems under partially ordered observation sequences
(Institute of Electrical and Electronics Engineers Inc., 2016)We consider the problem of decentralized state estimation, where two or more observation sites send information to a coordinator who aims to determine the set of possible current states of a given discrete event system ...

Conference Object
Distributed diagnosis using predetermined synchronization strategies in the presence of communication constraints
(IEEE Computer Society, 2015)We consider distributed fault diagnosis in a discrete event system modeled as a nondeterministic finite automaton that is observed at multiple observation sites through distinct natural projection maps. The majority of ...

Article
Distributed Fault Diagnosis in Discrete Event Systems via Set Intersection Refinements
(2018)We extend and verify diagnosability for a class of set intersection refinement strategies, which can be used for distributed state estimation and fault diagnosis in nondeterministic finite automata that are observed at ...

Conference Object
Initial state opacity in stochastic des
(2013)A nondeterministic finite automaton is initialstate 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
Intersection based decentralized diagnosis: Implementation and verification
(Institute of Electrical and Electronics Engineers Inc., 2013)We consider decentralized diagnosis in discrete event systems that are modeled as nondeterministic finite automata and are observed, through distinct natural projection maps, at multiple observation sites. Specifically, ...

Conference Object
Opacity formulations and verification in discrete event systems
(Institute of Electrical and Electronics Engineers Inc., 2014)In many emerging security applications, a property of a system, that may reveal important details about its behaviour, needs to be kept secret (opaque) to outside observers (intruders). Motivated by such applications, ...

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 currentstate opaque if the entrance of the ...

Article
Opacityenforcing supervisory strategies via state estimator constructions
(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
(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 ...

Article
Verification of infinitestep opacity and complexity considerations
(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 ...

Article
Verification of initialstate opacity in security applications of discrete event systems
(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 ...

Article
Verification of Kstep 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 Kstep opacity for systems ...