Naimark Dilations, State-Space Generators and Transmission Lines

Author(s):  
T. Kailath ◽  
A. M. Bruckstein
2005 ◽  
Vol 20 (3) ◽  
pp. 2358-2358 ◽  
Author(s):  
JoseA. RosendoMacias ◽  
A. Exposito ◽  
A. BachillerSoler

2003 ◽  
Vol 29 (5) ◽  
pp. 603-611 ◽  
Author(s):  
Saadetdin Herdem ◽  
M.Salih Mamiş

Author(s):  
ATTILA CSENKI

We consider systems whose time–dependent behaviour can be described by a Markov chain with a finite state space. There is a finite set of subsets of the state space given and every point in the time interval under consideration is associated with one of these subsets, thereby definig a demand (or usage) pattern. Closed form expressions are derived for the probability of a demand pattern being satisfied, in both, discrete and continuous time. Known reliability measures are identified as special cases. We illustrate the theory on two examples: the first is a system comprising three power transmission lines, the second is a small computer system consisting of four units, each in one of the states up or down. The demand patterns cover a four–week period.


2000 ◽  
Vol 55 (1) ◽  
pp. 7-14 ◽  
Author(s):  
Mehmet Salih Mamiş ◽  
Muhammet Köksal

Sign in / Sign up

Export Citation Format

Share Document