Computing transience bounds of emergency call centers: a hierarchical timed Petri net approach (Q2165235): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4285293964 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 2202.02752 / rank | |||
Normal rank | |||
Latest revision as of 02:35, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing transience bounds of emergency call centers: a hierarchical timed Petri net approach |
scientific article |
Statements
Computing transience bounds of emergency call centers: a hierarchical timed Petri net approach (English)
0 references
19 August 2022
0 references
timed Petri nets
0 references
continuous Petri nets
0 references
stationary regimes
0 references
transience bound
0 references
emergency call centers
0 references
semi-Markov decision processes
0 references
stochastic shortest path
0 references
