Browsing by Subject "Polynomial complexity"
Now showing items 18 of 8

Conference Object
Bounds on the probability of misclassification among hidden Markov models
(2011)Given a sequence of observations, classification among two known hidden Markov models (HMMs) can be accomplished with a classifier that minimizes the probability of error (i.e., the probability of misclassification) by ...

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
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
Performance analysis of sumproduct algorithms for multiple fault diagnosis applications
(2010)In this paper, we study the application of sumproduct algorithms (SPAs) to multiple fault diagnosis (MFD) problems in order to diagnose the most likely state of each component given the status of alarms. SPAs are heuristic ...

Article
Probabilistic system opacity in discrete event systems
(2018)In many emerging security applications, a system designer frequently needs to ensure that a certain property of a given system (that may reveal important details about the system’s operation) be kept secret (opaque) to ...

Conference Object
Probabilistic system opacity in discrete event systems
(Institute of Electrical and Electronics Engineers Inc., 2016)In many emerging security applications, a system designer frequently needs to ensure that a certain property of a given system (that may reveal important details about the system's operation) be kept secret (opaque) to ...

Conference Object
Resolution of initialstate in security applications of des
(2012)A nondeterministic labeled finite automaton is initialstate 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 detectability in Probabilistic Finite Automata
(2017)In this paper we analyze state estimation in stochastic discrete event systems (SDES) that can be modeled as probabilistic finite automata (PFAs). For a given PFA, we obtain the necessary and sufficient conditions that ...