Pages that link to "Item:Q2948248"
From MaRDI portal
The following pages link to Improving Time Bounded Reachability Computations in Interactive Markov Chains (Q2948248):
Displaying 5 items.
- Efficient approximation of optimal control for continuous-time Markov games (Q259052) (← links)
- Markov automata: deciding weak bisimulation by means of non-naïvely vanishing states (Q2252526) (← links)
- A Tutorial on Interactive Markov Chains (Q2937729) (← links)
- Scenario-Based Verification of Uncertain MDPs (Q5039513) (← links)
- The linear time-branching time spectrum of equivalences for stochastic systems with non-determinism (Q5919051) (← links)
