Show simple item record

dc.contributor.authorKeroglou, C.en
dc.contributor.authorHadjicostis, Christoforos N.en
dc.creatorKeroglou, C.en
dc.creatorHadjicostis, Christoforos N.en
dc.date.accessioned2019-04-08T07:46:26Z
dc.date.available2019-04-08T07:46:26Z
dc.date.issued2017
dc.identifier.urihttp://gnosis.library.ucy.ac.cy/handle/7/43776
dc.description.abstractIn 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 guarantee exact state estimation, at least asymptotically, with increasing certainty as more information is acquired from observing the behavior of the given PFA, by defining the notion of AA-detectability, and providing necessary and sufficient conditions that can be used to verify it. The characterization and analysis of AA-detectability is transformed to a problem of classification between two (or more) PFAs, which capture the recurrent behavior of an underlying Markov process that is obtained by ignoring output behavior and focusing on state transitions in the given PFA. Our approach combines techniques used in classification between two (or more) PFAs with state estimation methods used in logical discrete event systems (DES). We prove that the proposed verification of AA-detectability is of polynomial complexity with respect to the size of the state space of the given PFA. © 2017 Elsevier Ltden
dc.sourceAutomaticaen
dc.source.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85029678724&doi=10.1016%2fj.automatica.2017.08.027&partnerID=40&md5=df2cb05f7c17659da9cfb68a6d92fa66
dc.subjectMarkov processesen
dc.subjectStochastic systemsen
dc.subjectMarkov modelsen
dc.subjectDiscrete event simulationen
dc.subjectDiscrete event systemsen
dc.subjectFinite automataen
dc.subjectState estimationen
dc.subjectDetectabilityen
dc.subjectStochastic discrete event systemsen
dc.subjectPolynomial complexityen
dc.subjectProbabilistic finite automataen
dc.subjectMarkov modelen
dc.subjectOn stateen
dc.subjectState estimation methodsen
dc.titleVerification of detectability in Probabilistic Finite Automataen
dc.typeinfo:eu-repo/semantics/article
dc.identifier.doi10.1016/j.automatica.2017.08.027
dc.description.volume86
dc.description.issueJournal Articleen
dc.description.startingpage192
dc.description.endingpage198
dc.author.facultyΠολυτεχνική Σχολή /Faculty of Engineering
dc.author.departmentΤμήμα Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών / Department of Electrical and Computer Engineering
dc.type.uhtypeArticleen
dc.source.abbreviationAutomaticaen
dc.contributor.orcidHadjicostis, Christoforos N. [0000-0002-1706-708X]


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record