• Article  

      Least-cost planning sequence estimation in labelled Petri nets 

      Li, L.; Hadjicostis, Christoforos N. (2011)
      This paper develops a recursive algorithm for estimating the least-cost planning sequence in a manufacturing system that is modelled by a labelled Petri net. We consider a setting where we are given a sequence of labels ...
    • Article  

      Least-cost transition firing sequence estimation in labeled Petri nets with unobservable transitions 

      Li, L.; Hadjicostis, Christoforos N. (2011)
      This 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 ...
    • Conference Object  

      Reachability analysis for a class of petri nets 

      Ru, Y.; Hadjicostis, Christoforos N. (2009)
      In this paper, we study the reachability problem for the class of (strictly) monotone Petri nets that we define based on algebraic conditions. More specifically, given a (strictly) monotone Petri net, an initial marking ...