Show simple item record

dc.contributor.authorLi, L.en
dc.contributor.authorHadjicostis, Christoforos N.en
dc.creatorLi, L.en
dc.creatorHadjicostis, Christoforos N.en
dc.date.accessioned2019-04-08T07:46:57Z
dc.date.available2019-04-08T07:46:57Z
dc.date.issued2011
dc.identifier.urihttp://gnosis.library.ucy.ac.cy/handle/7/44076
dc.description.abstractThis paper proposes an approach for estimating the least-cost transition firing sequence(s) that matches (match) the observation of a sequence of labels produced by transition activity in a given labeled Petri net. Each transition in the labeled net is associated with a (possibly empty) label and also with a nonnegative cost which captures its likelihood (e.g., in terms of the amount of workload or power required to execute the transition). Given full knowledge of the structure of the labeled Petri net and the observation of a sequence of labels, we aim at finding the transition firing sequence(s) that is (are) consistent with both the observed label sequence and the Petri net, and also has (have) the least total cost (i.e., the least sum of individual transition costs). The existence of unobservable transitions makes this task extremely challenging since the number of firing sequences that might be consistent can potentially be infinite. Under the assumption that the unobservable transitions in the net form an acyclic subnet and have strictly positive costs, we develop a recursive algorithm that is able to find the least-cost firing sequence(s) by reconstructing only a finite number of firing sequences. In particular, if the unobservable transitions in the net are contact-free, the proposed recursive algorithm finds the least-cost transition firing sequences with complexity that is polynomial in the length of the observed sequence of labels. © 2010 IEEE.en
dc.sourceIEEE Transactions on Automation Science and Engineeringen
dc.source.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-79953778598&doi=10.1109%2fTASE.2010.2070065&partnerID=40&md5=0c819be3c082fad4e2d87d7666c85a35
dc.subjectEstimationen
dc.subjectAlgorithmsen
dc.subjectPetri netsen
dc.subjectGraph theoryen
dc.subjectUnobservableen
dc.subjectLabeled petri netsen
dc.subjectRecursive algorithmsen
dc.subjectFinite numberen
dc.subjectCostsen
dc.subjectTransition activityen
dc.subjectFiring sequencesen
dc.subjectTotal costsen
dc.subjectTransition firingsen
dc.subjectLeast-cost event estimationen
dc.subjectReconstructionen
dc.subjectTransition costsen
dc.subjectTransition firing sequenceen
dc.titleLeast-cost transition firing sequence estimation in labeled Petri nets with unobservable transitionsen
dc.typeinfo:eu-repo/semantics/article
dc.identifier.doi10.1109/TASE.2010.2070065
dc.description.volume8
dc.description.issue2
dc.description.startingpage394
dc.description.endingpage403
dc.author.facultyΠολυτεχνική Σχολή / Faculty of Engineering
dc.author.departmentΤμήμα Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών / Department of Electrical and Computer Engineering
dc.type.uhtypeArticleen
dc.source.abbreviationIEEE Trans.Autom.Sci.Eng.en
dc.contributor.orcidHadjicostis, Christoforos N. [0000-0002-1706-708X]
dc.gnosis.orcid0000-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