The following pages link to (Q4255597):
Displaying 9 items.
- Continuous-time block-monotone Markov chains and their block-augmented truncations (Q347491) (← links)
- Investigating dynamic reliability and availability through state-space models (Q356395) (← links)
- Flexible hiring in a make to order system with parallel processing units (Q383156) (← links)
- The single server vacation queueing model with geometric abandonments (Q538144) (← links)
- Recurrence and transience for finite probabilistic tables (Q631776) (← links)
- Comparison of level-crossing times for Markov and semi-Markov processes (Q871032) (← links)
- Probabilistic weak simulation is decidable in polynomial time (Q1029062) (← links)
- Comparative branching-time semantics for Markov chains (Q2387196) (← links)
- Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes (Q2575731) (← links)
