Pages that link to "Item:Q1941879"
From MaRDI portal
The following pages link to Probabilistic verification of Herman's self-stabilisation algorithm (Q1941879):
Displayed 11 items.
- A nearly optimal upper bound for the self-stabilization time in Herman's algorithm (Q498668) (← links)
- Model checking finite-horizon Markov chains with probabilistic inference (Q832295) (← links)
- Modeling and analysis of the obstacle-avoidance strategies for a mobile robot in a dynamic environment (Q1666714) (← links)
- Reachability in parametric interval Markov chains using constraints (Q1786613) (← links)
- Inductive synthesis for probabilistic programs reaches new horizons (Q2044199) (← links)
- Accelerating SpMV multiplication in probabilistic model checkers using GPUs (Q2119962) (← links)
- Synthesizing optimal bias in randomized self-stabilization (Q2121058) (← links)
- Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination (Q2182734) (← links)
- A tighter bound for the self-stabilization time in Herman's algorithm (Q2444741) (← links)
- Are Parametric Markov Chains Monotonic? (Q3297607) (← links)
- Action and State Based Computation Tree Measurement Language and Algorithms (Q6104809) (← links)