Hostname: page-component-78c5997874-8bhkd Total loading time: 0 Render date: 2024-11-02T23:33:45.799Z Has data issue: false hasContentIssue false

The finite dam II

Published online by Cambridge University Press:  14 July 2016

P. B. M. Roes*
Affiliation:
The University of Western Australia, Nedlands

Summary

A weir of capacity K is considered in which the water inflow is a process with stationary independent increments. Unless the weir is empty, there is a continuous release of water at unit rate; if K is finite the weir may become full in which case the excess water overflows instantaneously. A weir for which K is infinite will be referred to as infinite dam. For the latter the transient behaviour is well known if the input possesses a second moment (cf. e.g., Prabhu [7]) and serves as the starting point for the present paper. This result is first extended to yield the Laplace transform (L.T.) of the trivariate Laplace-Stieltjes transform (L.S.T.) of the content v(t) at time t, the input X(t) in (0, t) and the total time d(t) in the interval (0, t) during which the dam is dry. (Incidentally, the last two quantities, for relevant time intervals, will be carried throughout.) Then we use a relation between the latter and the L.S.T. of the expected number of downward level y crossings of the v(t) process established in Roes [9]. Since the dam processes considered are Markov processes, we have therewith the L.S.T. of the renewal function of the renewal process imbedded at level y. From this, one finds the L.S.T.'s of first entrance and taboo first entrance times (for their definition see introduction). Next we calculate the first skip times for the infinite dam from the first entrance times and the L.T. of the L.S.T. of v(t). It is then a routine matter to determine the taboo first skip times. From the (taboo) first entrance and skip times we derive the first entrance times for the finite dam, which in turn lead to the renewal functions of the renewal processes imbedded in the finite dam content process v*(t) and hence to the transient behaviour of the finite dam.

The advantage of the present approach over the one given in Roes [8] is that it is entirely probabilistic and avoids involved analytic arguments. As a result, the question of uniqueness of the solution does not arise, while more insight is obtained in the structure. The L.S.T. of several first entrance times and first skip times have been derived by Cohen [2] for compound Poisson input.

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1970 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] Chung, K. L. (1960) Markov Chains with Stationary Transition Probabilities. Springer Verlag, Berlin.Google Scholar
[2] Cohen, J. W. (1969) The Single Server Queue. North Holland Publ. Co., Amsterdam.Google Scholar
[3] Cox, D. R. and Miller, H. D. (1965) The Theory of Stochastic Processes. Methuen, London.Google Scholar
[4] Doetsch, G. (1950) Handbuch der Laplace-Transformation I. Verlag Birkhäuser, Basel.Google Scholar
[5] Gani, J. and Prabhu, N. U. (1963) A storage model with continuous infinitely divisible inputs. Proc. Camb. Phil. Soc. 59, 417429.Google Scholar
[6] Gani, J. and Pyke, R. (1960) The content of a dam as the supremum of an infinitely divisible process. J. Math. Mech. 9, 639652.Google Scholar
[7] Prabhu, N. U. (1965) Queues and Inventories. Wiley, New York.Google Scholar
[8] Roes, P.B.M. (1970) The finite dam. J. Appl. Prob. 7, 316326.Google Scholar
[9] Roes, P. B. M. (1970) On the expected number of crossings of a level in certain stochastic processes. J. Appl. Prob. 7, 766770.Google Scholar
[10] Takács, L. (1967) Combinatorial Methods in the Theory of Stochastic Processes. Wiley, New York.Google Scholar
[11] Widder, D. V. (1946) The Laplace Transform. Princeton University Press, Princeton.Google Scholar