Pages that link to "Item:Q2986781"
From MaRDI portal
The following pages link to Approximate Verification of the Symbolic Dynamics of Markov Chains (Q2986781):
Displaying 12 items.
- Reachability problems for Markov chains (Q477610) (← links)
- Additive \(N\)-step Markov chains as prototype model of symbolic stochastic dynamical systems with long-range correlations (Q944823) (← links)
- A note on the attractor-property of infinite-state Markov chains (Q1045897) (← links)
- When are stochastic transition systems tameable? (Q1648646) (← links)
- The complexity of synchronizing Markov decision processes (Q1740670) (← links)
- Decidability of Approximate Skolem Problem and Applications to Logical Verification of Dynamical Properties of Markov Chains (Q2946750) (← links)
- (Q5111636) (← links)
- (Q5155671) (← links)
- Approximate Verification of the Symbolic Dynamics of Markov Chains (Q5501948) (← links)
- Correct Hardware Design and Verification Methods (Q5897081) (← links)
- Incremental Verification of Parametric and Reconfigurable Markov Chains (Q6104805) (← links)
- Stochastic games with synchronizing objectives (Q6649478) (← links)