The following pages link to (Q5137353):
Displaying 21 items.
- Compositional probabilistic verification through multi-objective model checking (Q386007) (← links)
- Branching bisimulation congruence for probabilistic systems (Q764289) (← links)
- Experiments with deterministic \(\omega\)-automata for formulas of linear temporal logic (Q860862) (← links)
- Reachability in recursive Markov decision processes (Q924718) (← links)
- On the use of MTBDDs for performability analysis and verification of stochastic systems. (Q1400289) (← links)
- Automatic verification of real-time systems with discrete probability distributions. (Q1603709) (← links)
- Task-structured probabilistic I/O automata (Q1745718) (← links)
- The satisfiability problem for a quantitative fragment of PCTL (Q2140493) (← links)
- Preface to the special issue on probabilistic model checking (Q2248070) (← links)
- Model checking for probabilistic timed automata (Q2248072) (← links)
- Symbolic model checking for probabilistic timed automata (Q2373877) (← 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)
- Weak Probabilistic Anonymity (Q2864392) (← links)
- Exogenous Probabilistic Computation Tree Logic (Q2870286) (← links)
- Model Checking Probabilistic Systems (Q3176386) (← links)
- On-the-Fly Stuttering in the Construction of Deterministic ω-Automata (Q3503894) (← links)
- Quantitative Analysis under Fairness Constraints (Q3648696) (← links)
- Model Checking Linear-Time Properties of Probabilistic Systems (Q5072555) (← links)
- The satisfiability problem for a quantitative fragment of PCTL (Q6078294) (← links)
- Correlated equilibria and fairness in concurrent stochastic games (Q6535606) (← links)
