No open-access location is known for this record yet.
No open-access location is known for this record yet.
Abstract This paper discusses a class of analytically and numerically tractable renewal processes, which generalize the Poisson process. When used to describe interarrival or service times in queues, these renewal processes lead to computationally explicit solutions which involve only real arithmetic. Previous modifications of the Poisson process, based on the Erlang or the hyperexponential distributions, appear as particular cases.
Loading…
Stored only when both papers are in the corpus — 105 citations exist upstream.
Papers that cite the same references — the relational fallback while embeddings are still backfilling.
Imported from OpenAlex (CC0) — nothing here is generated.