Performance bounds for stochastic timed Petri nets
From MaRDI portal
Publication:5096370
DOI10.1007/3-540-60029-9_47zbMath1496.68240OpenAlexW1789212252MaRDI QIDQ5096370
No author found.
Publication date: 16 August 2022
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-60029-9_47
linear programminguniformizationperformance boundthroughputmean token numberstochastic timed Petri net
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ergodic theory of stochastic Petri networks
- Recursive equations and basic properties of timed Petri nets
- Markov chain models - rarity and exponentiality
- Optimization of multiclass queueing networks: Polyhedral and nonlinear characterizations of achievable performance
- A study of the cyclic scheduling problem on parallel processors
- Mean-Value Analysis of Closed Multichain Queuing Networks
- Computational algorithms for product form queueing networks
- Properties and performance bounds for closed free choice synchronized monoclass queueing networks
- Queuing Networks with Multiple Closed Chains: Theory and Computational Algorithms
- Embedded product-form queueing networks and the improvement of performance bounds for Petri net systems
- Performance bounds for queueing networks and scheduling policies
- Stability of queueing networks and scheduling policies
- Branching bandits and Klimov's problem: achievable region and side constraints
- Parallel simulation of stochastic Petri nets using recurrence equations
- Technical Note—A Last Word on L = λW
- Comparison properties of stochastic decision free Petri nets
- Computational algorithms for closed queueing networks with exponential servers
This page was built for publication: Performance bounds for stochastic timed Petri nets