Markov regenerative stochastic Petri nets with age type general transitions
From MaRDI portal
Publication:5096375
Markov regenerative processesqueueing systems with preemptive resume servicestochastic Petri netstransient analysis
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) 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)
Recommendations
- Markov regenerative stochastic Petri nets with general execution policies: supplementary variable analysis and a prototype tool
- Transient analysis of Age-MRSPNs by the method of supplementary variables
- Transient analysis of Age-MRSPNs by the method of supplementary variables
- scientific article; zbMATH DE number 956816
- MRSPN analysis of semi-Markovian finite source retrial queues
Cites work
- An improved numerical algorithm for calculating steady-state solutions of deterministic and stochastic Petri net models
- An Inversion Technique for the Laplace Transform
- scientific article; zbMATH DE number 3532286 (Why is no real title available?)
- Markov and Markov reward model transient analysis: An overview of numerical approaches
Cited in
(4)- Transient analysis of Age-MRSPNs by the method of supplementary variables
- Markov regenerative stochastic Petri nets with general execution policies: supplementary variable analysis and a prototype tool
- scientific article; zbMATH DE number 956816 (Why is no real title available?)
- Compositional safe approximation of response time probability density function of complex workflows
This page was built for publication: Markov regenerative stochastic Petri nets with age type general transitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096375)
