Infinite dams with discrete additive inputs
- 1 March 1977
- journal article
- research article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 14 (01) , 170-180
- https://doi.org/10.1017/s0021900200104760
Abstract
This paper considers an infinite dam fed by a discrete input Xt during the time interval [t, t + 1), t = 0, 1, 2, ···. At time t – 0 there is an output Yt = min(Zt –1, + Xt –1, r) from the dam leaving behind the amount Zt = max(0, Zt –1, + Xt –1, r). The probability Pr(Zt = i), i = 0, 1, 2, ··· is discussed under the strict assumption that r > 1 and the given initial condition that Z 0 = u, u = 1, 2, ···. The generating function technique has been used throughout the paper.Keywords
This publication has 4 references indexed in Scilit:
- Recent advances in storage and flooding theoryAdvances in Applied Probability, 1969
- Infinite dams with inputs forming a Markov chainJournal of Applied Probability, 1968
- Time-dependent results in storage theoryJournal of Applied Probability, 1964
- Elementary methods for an occupancy problem of storageMathematische Annalen, 1958