Browsing by Subject "Recursive algorithms"

Article

Adaptive scheduling over a wireless channel under constrained jamming

Fernández Anta, Antonio; Georgiou, Chryssis; Zavou, Elli (2015)

We consider a wireless channel between a single pair of stations (sender and receiver) that is being “watched” and disrupted by a malicious, adversarial jammer. The sender’s objective is to transmit as much useful data as ...

Conference Object

Decentralized state estimation in discrete event systems under partially ordered observation sequences

Hadjicostis, Christoforos N.; Seatzu, C. (Institute of Electrical and Electronics Engineers Inc., 2016)

We consider the problem of decentralized state estimation, where two or more observation sites send information to a coordinator who aims to determine the set of possible current states of a given discrete event system ...

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 ...

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 ...

Conference Object

Least-cost transition firing sequence estimation in labeled petri nets

Li, N.; Ru, Y.; Hadjicostis, Christoforos N. (2006)

This paper develops a recursive algorithm for estimating the least-cost transition firing sequence(s) based on the observation of a sequence of labels produced by transition activity in a given labeled Petri net. Each ...

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

Minimum initial marking estimation in labeled petri nets

Li, L.; Hadjicostis, Christoforos N. (2009)

This paper develops an algorithm for estimating the minimum initial marking based on the observation of a sequence of labels that is produced by underlying transition activity in a given labeled Petri net. We assume that ...

Article

Minimum initial marking estimation in labeled petri nets

Li, L.; Hadjicostis, Christoforos N. (2013)

This technical note develops algorithms for estimating the minimum initial marking(s) following the observation of a sequence of labels produced by underlying transition activity in a known labeled Petri net (PN). Since ...

Conference Object

Probabilistic marking estimation in labeled petri nets

Cabasino, M. P.; Hadjicostis, Christoforos N.; Seatzu, C. (Institute of Electrical and Electronics Engineers Inc., 2013)

Given a labeled Petri net, possibly with silent transitions, we are interested in performing current marking estimation in a probabilistic setting. We assume a known initial marking or a known finite set of initial markings, ...

Article

Probabilistic marking estimation in labeled petri nets

Cabasino, M. P.; Hadjicostis, Christoforos N.; Seatzu, C. (2015)

Given a labeled Petri net, possibly with silent (unobservable) transitions, we are interested in performing marking estimation in a probabilistic setting. We assume a known initial marking or a known finite set of initial ...