Randomization Procedures in the Computation of Cumulative-Time Distributions over Discrete State Markov Processes
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3905611
- The Randomization Technique as a Modeling Tool and Solution Procedure for Transient Markov Processes
- Computation of bounds for transient measures of large rewarded Markov models using regenerative randomization.
- Numerical Computation of Sojourn-Time Distributions in Queuing Networks
- Time distributions in discrete time Markov processes
Cited in
(38)- Discrete-time stochastic modeling and simulation of biochemical networks
- Means and variances of time averages in Markovian environments
- Numerical transient analysis of Markov models
- Analysis of a three node queueing network
- Nonstationary queues with interrupted Poisson arrivals and unreliable/repairable servers
- Uniformization for nonhomogeneous Markov chains
- Numerical computation of response time distributions using stochastic reward nets
- Analytical computation of Markov chain using Padé approximations
- Model-checking large structured Markov chains.
- Computation of bounds for transient measures of large rewarded Markov models using regenerative randomization.
- Hypergraph-based parallel computation of passage time densities in large semi-Markov models
- First passage times for Markov renewal processes and applications
- Optimal decisions for continuous time Markov decision processes over finite planning horizons
- A dependability measure for Markov models of repairable systems: Solution by randomization and computational experience
- Simulation-based transfer function modeling for transient analysis of general queueing systems
- Analysis of queueing systems with customer interjections
- On first passage times in discrete skeletons and uniformized versions of a continuous-time Markov chain
- A numerical approach for evaluating the time-dependent distribution of a quasi birth-death process
- Approximate adaptive uniformization of continuous-time Markov chains
- Efficient implementations of the randomization method with control of the relative error
- Model checking for performability
- The Randomization Technique as a Modeling Tool and Solution Procedure for Transient Markov Processes
- PH-graphs for analyzing shortest path problems with correlated traveling times
- A Markov-chain method for computing the run-length distribution of the self-starting cumulative sum scheme
- scientific article; zbMATH DE number 3905611 (Why is no real title available?)
- Performability of automated manufacturing systems with centralized material handling
- The exit time finite state projection scheme: bounding exit distributions and occupation measures of continuous-time Markov chains
- Some results about randomized binary Markov chains: theory, computing and applications
- scientific article; zbMATH DE number 6027069 (Why is no real title available?)
- Monotonicity and comparison results for nonnegative dynamic systems. II: Continuous-time case.
- A Generalized Method for the Transient Analysis of Markov Models of Fault-Tolerant Systems with Deferred Repair
- Transient Analysis of Large Markov Models with Absorbing States Using Regenerative Randomization
- Numerical analysis of continuous time Markov decision processes over finite horizons
- Four Canadian Contributions to Stochastic Modeling
- Algorithms for Markov stochastic models
- First passage times for multidimensional denumerable state Markov processes
- Time distributions in discrete time Markov processes
- Mathematical theory of queueing networks
This page was built for publication: Randomization Procedures in the Computation of Cumulative-Time Distributions over Discrete State Markov Processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3337918)
