Approximate throughput computation of stochastic marked graphs (Q1200153)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximate throughput computation of stochastic marked graphs |
scientific article; zbMATH DE number 96801
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximate throughput computation of stochastic marked graphs |
scientific article; zbMATH DE number 96801 |
Statements
Approximate throughput computation of stochastic marked graphs (English)
0 references
17 January 1993
0 references
marked graphs
0 references
fork/join queueing networks
0 references
qualitative theory
0 references
multiple cuts
0 references
hierarchical decomposition
0 references
