#### Filter Results:

- Full text PDF available (125)

#### Publication Year

1973

2017

- This year (3)
- Last 5 years (37)
- Last 10 years (75)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

Abstruct-Fault detection and isolation is a crucial and challenging task in the automatic control of large complex systems. We propose a discrete-event system (DES) approach to the problem of failure diagnosis. We introduce two related notions of diagnosability of DES’s in the framework of formal languages and compare diagnosability with the related notions… (More)

- Meera Sampath, Raja Sengupta, Stéphane Lafortune, Kasim Sinnamohideen, Demosthenis Teneketzis
- IEEE Trans. Contr. Sys. Techn.
- 1996

AbstructDetection and isolation of failures in large, complex systems is a crucial and challenging task. The increasingly stringent requirements on performance and reliability of complex technological systems have necessitated the development of sophisticated and systematic methods for the timely and accurate diagnosis of system failures. We propose a… (More)

- Rami Debouk, Stéphane Lafortune, Demosthenis Teneketzis
- Discrete Event Dynamic Systems
- 2000

Rami Debouk, St ephane Lafortune and Demosthenis Teneketzis Department of Electrical Engineering and Computer Science The University of Michigan, Ann Arbor, MI 48109{2122, USA fridebouk,stephane,teneketg@eecs.umich.edu; www.eecs.umich.edu/umdes Abstract We address the problem of failure diagnosis in discrete event systems with decentralized information. We… (More)

- David Thorsley, Demosthenis Teneketzis
- IEEE Trans. Automat. Contr.
- 2005

We investigate diagnosability of stochastic discrete-event systems. We define the notions of Aand AA-diagnosability for stochastic automata; these notions are weaker than the corresponding notion of diagnosability for logical automata introduced by Sampath et al. Through the construction of a stochastic diagnoser, we determine offline conditions necessary… (More)

We consider multiarmed bandit problems with switching cost, define uniformly good allocation rules, and restrict attention to such rules. We present a lower bound on the asymptotic performance of uniformly good allocation rules and construct an allocation scheme that achieves the bound. We discover that despite the inclusion of a switching cost the proposed… (More)

Abstruct-We consider a controlled i.i.d. process whose distribution is parametrized by an unknown parameter 8 belonging to some known parameter space 8, and a one-step reward associated with each pair of control and the following state of the process. The objective is to maximize the expected value of the sum of one-step rewards over an infinite horizon. By… (More)

- Christopher Lott, Demosthenis Teneketzis
- IEEE Trans. Automat. Contr.
- 2006

We investigate a network routing problem where a probabilistic local broadcast transmission model is used to determine routing. We discuss this model’s key features, and note that the local broadcast transmission model can be viewed as soft handoff for an ad-hoc network. We present results showing that an index policy is optimal for the routing problem. We… (More)

AbstmctWe consider a controlled Markov chain whose transition probabilities and initial distribution are parametrized by an unknown parameter 6 belonging to some known parameter space 9. There is a one-step reward associated with each pair of control and the following state of the process. The objective is to maximize the expected value of the sum of… (More)

- Demosthenis Teneketzis
- IEEE Transactions on Information Theory
- 2006

The output of a discrete-time Markov source must be encoded into a sequence of discrete variables. The encoded sequence is transmitted through a noisy channel to a receiver that must attempt to reproduce reliably the source sequence. Encoding and decoding must be done in real-time and the distortion measure does not tolerate delays. The structure of… (More)

We model a single-hop mobile network under centralized control with N service classes as a system of N weighted cost parallel queues with M ~1 # M , N ! servers, arrivals, varying binary connectivity, and Bernoulli service success at each queue+ We consider scheduling problems in this system and, under various assumptions on arrivals and connectivity,… (More)