Pages that link to "Item:Q3000641"
From MaRDI portal
The following pages link to Quantitative Multi-objective Verification for Probabilistic Systems (Q3000641):
Displayed 36 items.
- Synthesizing efficient systems in probabilistic environments (Q300419) (← links)
- Quantitative verification and strategy synthesis for stochastic games (Q328165) (← links)
- Trading performance for stability in Markov decision processes (Q340568) (← links)
- Compositional probabilistic verification through multi-objective model checking (Q386007) (← links)
- Reformulation of the linear program for completely ergodic MDPs with average cost criteria (Q1676496) (← links)
- Probabilistic black-box reachability checking (extended version) (Q2008284) (← links)
- Multi-objective optimization of long-run average and total rewards (Q2044201) (← links)
- Faster algorithms for quantitative verification in bounded treewidth graphs (Q2058390) (← links)
- Enhancing probabilistic model checking with ontologies (Q2065528) (← links)
- Lifted model checking for relational MDPs (Q2102421) (← links)
- Multi-objective dynamic programming with limited precision (Q2114599) (← links)
- Markov automata with multiple objectives (Q2151241) (← links)
- Collaborative models for autonomous systems controller synthesis (Q2198131) (← links)
- Multi-cost bounded tradeoff analysis in MDP (Q2208304) (← links)
- Synthesis of covert actuator attackers for free (Q2220340) (← links)
- Exact quantitative probabilistic model checking through rational search (Q2225475) (← links)
- Error bounds for stochastic shortest path problems (Q2408892) (← links)
- Optimal schedulers vs optimal bases: an approach for efficient exact solving of Markov decision processes (Q2453111) (← links)
- Interval iteration algorithm for MDPs and IMDPs (Q2636515) (← links)
- A multi-objective approach for PH-graphs with applications to stochastic shortest paths (Q2661758) (← links)
- Deniable Functional Encryption (Q2798776) (← links)
- Quantitative Multi-objective Verification for Probabilistic Systems (Q3000641) (← links)
- Verifying Team Formation Protocols with Probabilistic Model Checking (Q3092303) (← links)
- Graph Games and Reactive Synthesis (Q3176385) (← links)
- Model Checking Probabilistic Systems (Q3176386) (← links)
- Sequential Convex Programming for the Efficient Verification of Parametric MDPs (Q3303926) (← links)
- Model Checking Exact Cost for Attack Scenarios (Q3304816) (← links)
- Quantitative Automata under Probabilistic Semantics (Q4635863) (← links)
- (Q5028426) (← links)
- Farkas Certificates and Minimal Witnesses for Probabilistic Reachability Constraints (Q5039515) (← links)
- Simple Strategies in Multi-Objective MDPs (Q5039517) (← links)
- Probabilistic Timed Automata with One Clock and Initialised Clock-Dependent Probabilities (Q5041280) (← links)
- Computational Benefits of Intermediate Rewards for Goal-Reaching Policy Learning (Q5076329) (← links)
- Probabilistic Model Checking for Energy-Utility Analysis (Q5418957) (← links)
- Combinations of Qualitative Winning for Stochastic Parity Games (Q5875367) (← links)
- Formal modelling and verification of probabilistic resource bounded agents (Q6190087) (← links)