Pages that link to "Item:Q2946660"
From MaRDI portal
The following pages link to Model Checking of Recursive Probabilistic Systems (Q2946660):
Displayed 9 items.
- Branching-time model-checking of probabilistic pushdown automata (Q394999) (← links)
- The satisfiability problem for a quantitative fragment of PCTL (Q2140493) (← links)
- Language equivalence of probabilistic pushdown automata (Q2252520) (← links)
- Recursive Markov Decision Processes and Recursive Stochastic Games (Q2796398) (← links)
- Model Checking Probabilistic Systems (Q3176386) (← links)
- Deciding Fast Termination for Probabilistic VASS with Nondeterminism (Q3297606) (← links)
- (Q5129945) (← links)
- A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes (Q5363381) (← links)
- The satisfiability problem for a quantitative fragment of PCTL (Q6078294) (← links)