Πλοήγηση Τμήμα Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών / Department of Electrical and Computer Engineering ανά Θέμα "(algorithmic) complexity"
Αποτελέσματα 1-1 από 1
-
Conference Object
Least-cost firing sequence estimation in labeled Petri nets with unobservable transitions
(2007)This paper develops a recursive algorithm for estimating the least-cost transition firing sequences that match the observation of a sequence of labels produced by transition activity in a given labeled Petri net. The Petri ...