Comparison properties of stochastic decision free Petri nets
DOI10.1109/9.182477zbMATH Open0772.60071OpenAlexW2042157765MaRDI QIDQ5288499FDOQ5288499
Authors: Francois Baccelli, Zhen Liu
Publication date: 12 August 1993
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00075127/file/RR-1433.pdf
Recommendations
markingconvex monotonicitylog-concave distribution functionsstochastic comparison problemsstochastic decision free Petri nets
Queueing theory (aspects of probability theory) (60K25) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Cited In (9)
- A resource allocation problem on timed marked graphs: a decomposition approach
- Title not available (Why is that?)
- Histogram based bounds and approximations for production lines
- Cyclic networks with general blocking and starvation
- Throughput Scalability Analysis of Fork-Join Queueing Networks
- Performance bounds for stochastic timed Petri nets
- Marking optimization of stochastic timed event graphs using IPA
- Asymptotic properties of stochastic timed event graphs
- 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)