Stationary deterministic flows in discrete systems. I

DOI10.1016/0304-3975(83)90051-8zbMath0498.68024OpenAlexW2001121415WikidataQ56992523 ScholiaQ56992523MaRDI QIDQ1171375

Erol Gelenbe

Publication date: 1983

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(83)90051-8

zbMATH Keywords

concurrent systemsparallel processingqueueing networkasymptotic resultsPetri netlimiting behaviourLittle's formulavector addition systemstationary propertiesbirth and death type equationsarrivalcomplex computer systemdepartureinfinite time behaviourobservable propertiesperformance modelling of computer systems

Mathematics Subject Classification ID

Observability (93B07) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Theory of operating systems (68N25) Theory of software (68N99)

Related Items (5)

Stationary deterministic flows: II. The Single-server queue ⋮ Asymptotic time averages and frequency distributions ⋮ On pathwise behavior of queues ⋮ Deterministic analysis of queueing systems with heterogeneous servers ⋮ Sample-path analysis of processes with imbedded point processes

Cites Work

• Stationary deterministic flows: II. The Single-server queue
• Fundamental operational laws of computer system performance
• Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing
• Unnamed Item
• Unnamed Item

This page was built for publication: Stationary deterministic flows in discrete systems. I