Browsing by Subject "(algorithmic) complexity"

Now showing items 1-2 of 2

    • Conference Object  

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

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

      The power of the defender 

      Gelastou, Marina; Mavronicolas, Marios; Lesta, Vicky Papadopoulou; Philippou, Anna; Spirakis, Paul G. (2006)
      We consider a security problem on a distributed network. We assume a network whose nodes are vulnerable to infection by threats (e.g. viruses), the attackers. A system security software, the defender, is available in the ...