Continuous-Time Markov Chains and Memoryless Queues

Moshe Haviv
Additional contact information
Moshe Haviv: The Hebrew University

Chapter Chapter 8 in Queues, 2013, pp 107-138 from Springer

Abstract: Abstract We next define the model of a discrete state-space continuous-time Markov process. Let N = { 0, 1, 2, …,n} be the possible states of a process. The value of n can be finite or infinite but N should be discrete. Note that we use a numerical value to present a state just for convenience. In fact, state-i is nothing more than a name and is selected for reference purposes. Yet, in many cases these names have a meaning and their use may lead to a natural presentation of a state, such as the number of customers in a queue (when applicable).

Keywords: Markov Chain; Time-reversed Process; Irreducible Markov Process; Limited Investigation; Work-conserving System (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-1-4614-6765-6_8

Ordering information: This item can be ordered from
http://www.springer.com/9781461467656

DOI: 10.1007/978-1-4614-6765-6_8

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().