Metraipolis › archive › dc_141e0118eb93
Response Time Stochastic Analysis for Fixed-Priority Stable Real-Time Systems — arXiv:2609.21760
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.21760
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-10T02:09:47.583Z
- SHA-256 of the archived text
a820c945a9d339789c55d2d3faeeb4d1d1b1e8432a31181ff1bc06d67b3dced0- Stable URL of this page
https://metraipolis.com/documento/dc_141e0118eb93
How to cite
Response Time Stochastic Analysis for Fixed-Priority Stable Real-Time Systems — arXiv:2609.21760 — arXiv (en), https://arxiv.org/abs/2609.21760 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_141e0118eb93 (Metraipolis archive dc_141e0118eb93, sha256 a820c945a9d339789c55d2d3faeeb4d1d1b1e8432a31181ff1bc06d67b3dced0)
BibTeX
@misc{dc141e0118eb93,
title = {Response Time Stochastic Analysis for Fixed-Priority Stable Real-Time Systems — arXiv:2609.21760},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.21760},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_141e0118eb93; sha256 a820c945a9d339789c55d2d3faeeb4d1d1b1e8432a31181ff1bc06d67b3dced0},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.21760. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In this paper, we prove that a mean system utilization smaller than one is a necessary condition for the feasibility of real-time systems. Such systems are defined as stable. Stable systems have two distinct states: a transient state, followed by a steady-state where the same distribution of response times is repeated infinitely for each task. We prove that the Liu and Layland theorem holds for stable probabilistic real-time systems with implicit deadlines, we provide an analytical approximation of response times for each of those two states and a bound of the instant when a real-time system becomes steady. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-21 in math.PR). Categorie arXiv: Systems and Control (eess.SY) ; Probability (math.PR). Pagina del lavoro: https://arxiv.org/abs/2609.21760 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-10T01:47:50.225Z dalla pagina https://arxiv.org/catchup/math.PR/2026-09-21?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).