Continuous Time Processes
There is a fundamental difference between the mathematical formulation of a discrete time stochastic process and a continuous time stochastic process. In discrete time, it is necessary to specify only the mechanism for transition from one state to another, and of course the initial state (distribution) of the system. For Markov chains, this consists of the transition matrix and the initial vector. Everything about the chain can, in principle, be deduced from this matrix and vector.
KeywordsPoint Process Renewal Process Sojourn Time Probability Generate Function Counting Distribution
Unable to display preview. Download preview PDF.
- Çinlar, Erhan (1975), Introduction to Stochastic Processes, Prentice-Hall, Englewood Cliffs, New Jersey.Google Scholar
- Cox, D. R. (1962), Renewal Theory, John Wiley and Sons, New York.Google Scholar
- Cox, D. R., and Miller, H. D. (1965), The Theory of Stochastic Processes, Methuen, London.Google Scholar
- Hoel, Paul G., Port, Sidney C., and Stone, Charles J. (1972), Introduction to Stochastic Processes, Houghton Mifflin, Boston.Google Scholar
- Karlin, Samuel, and Taylor, Howard M., (1975), A First Course in Stochastic Processes, Academic Press, New York.Google Scholar
- Ross, Sheldon M. (1972), Introduction to Probability Models, Academic Press, New York.Google Scholar