Pages that link to "Item:Q3337918"
From MaRDI portal
The following pages link to Randomization Procedures in the Computation of Cumulative-Time Distributions over Discrete State Markov Processes (Q3337918):
Displaying 33 items.
- PH-graphs for analyzing shortest path problems with correlated traveling times (Q337529) (← links)
- Numerical analysis of continuous time Markov decision processes over finite horizons (Q609814) (← links)
- Algorithms for Markov stochastic models (Q701586) (← links)
- First passage times for multidimensional denumerable state Markov processes (Q701633) (← links)
- Mathematical theory of queueing networks (Q913640) (← links)
- Discrete-time stochastic modeling and simulation of biochemical networks (Q1004937) (← links)
- Means and variances of time averages in Markovian environments (Q1090010) (← links)
- Numerical transient analysis of Markov models (Q1101812) (← links)
- Analysis of a three node queueing network (Q1108676) (← links)
- Nonstationary queues with interrupted Poisson arrivals and unreliable/repairable servers (Q1115031) (← links)
- Uniformization for nonhomogeneous Markov chains (Q1195867) (← links)
- Numerical computation of response time distributions using stochastic reward nets (Q1315340) (← links)
- Analytical computation of Markov chain using Padé approximations (Q1332799) (← links)
- Model-checking large structured Markov chains. (Q1400291) (← links)
- Computation of bounds for transient measures of large rewarded Markov models using regenerative randomization. (Q1423444) (← links)
- Hypergraph-based parallel computation of passage time densities in large semi-Markov models (Q1434432) (← links)
- First passage times for Markov renewal processes and applications (Q1609562) (← links)
- Optimal decisions for continuous time Markov decision processes over finite planning horizons (Q1652046) (← links)
- A dependability measure for Markov models of repairable systems: Solution by randomization and computational experience (Q1903783) (← links)
- Simulation-based transfer function modeling for transient analysis of general queueing systems (Q1927001) (← links)
- Analysis of queueing systems with customer interjections (Q1934374) (← links)
- On first passage times in discrete skeletons and uniformized versions of a continuous-time Markov chain (Q2087063) (← links)
- A numerical approach for evaluating the time-dependent distribution of a quasi birth-death process (Q2157402) (← links)
- Approximate adaptive uniformization of continuous-time Markov chains (Q2308229) (← links)
- Efficient implementations of the randomization method with control of the relative error (Q2485165) (← links)
- Model checking for performability (Q2843861) (← links)
- Performability of automated manufacturing systems with centralized material handling (Q4394309) (← links)
- The Exit Time Finite State Projection Scheme: Bounding Exit Distributions and Occupation Measures of Continuous-Time Markov Chains (Q4628404) (← links)
- (Q5389859) (← links)
- (Q5389868) (← links)
- A Generalized Method for the Transient Analysis of Markov Models of Fault-Tolerant Systems with Deferred Repair (Q5697370) (← links)
- Transient Analysis of Large Markov Models with Absorbing States Using Regenerative Randomization (Q5719272) (← links)
- Four Canadian Contributions to Stochastic Modeling (Q6160338) (← links)