Comparison properties of stochastic decision free Petri nets
From MaRDI portal
Publication:5288499
Recommendations
Cited in
(9)- Throughput scalability analysis of fork-join queueing networks
- A resource allocation problem on timed marked graphs: a decomposition approach
- scientific article; zbMATH DE number 2020760 (Why is no real title available?)
- Histogram based bounds and approximations for production lines
- Cyclic networks with general blocking and starvation
- Asymptotic properties of stochastic timed event graphs
- Marking optimization of stochastic timed event graphs using IPA
- Performance bounds for stochastic timed Petri nets
- Probability masses Fitting in the analysis of manufacturing flow lines
This page was built for publication: Comparison properties of stochastic decision free Petri nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5288499)