Quantitative multi-objective verification for probabilistic systems
From MaRDI portal
Publication:3000641
Recommendations
- Compositional probabilistic verification through multi-objective model checking
- Automated verification and strategy synthesis for probabilistic systems
- Quantitative automata model checking of autonomous stochastic hybrid systems
- Automatic verification of competitive stochastic systems
- Multi-objective Model Checking of Markov Decision Processes
Cites work
- scientific article; zbMATH DE number 1128781 (Why is no real title available?)
- scientific article; zbMATH DE number 2163041 (Why is no real title available?)
- scientific article; zbMATH DE number 3240812 (Why is no real title available?)
- Assume-guarantee verification for probabilistic systems
- Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives
- Markov Decision Processes with Multiple Long-Run Average Objectives
- Markov Decision Processes with Multiple Objectives
- Markov decision processes and regular events
- Model checking of probabilistic and nondeterministic systems
- Multi-Objective Model Checking of Markov Decision Processes
- Probabilistic contracts: a compositional reasoning methodology for the design of systems with stochastic and/or non-deterministic aspects
- Quantitative analysis under fairness constraints
- Quantitative multi-objective verification for probabilistic systems
- Using probabilistic model checking for dynamic power management
Cited in
(44)- Stochastic games with disjunctions of multiple objectives
- Faster algorithms for quantitative verification in bounded treewidth graphs
- Model checking probabilistic systems
- Interval Markov decision processes with multiple objectives: from robust strategies to Pareto curves
- Multi-objective dynamic programming with limited precision
- Multi-objective optimization of long-run average and total rewards
- Model Checking Exact Cost for Attack Scenarios
- Multi-objective parameter synthesis in probabilistic hybrid systems
- Model-Free Reinforcement Learning for Lexicographic Omega-Regular Objectives
- Sequential convex programming for the efficient verification of parametric MDPs
- Compositional probabilistic verification through multi-objective model checking
- Graph Games and Reactive Synthesis
- Combinations of Qualitative Winning for Stochastic Parity Games
- Correct Hardware Design and Verification Methods
- Collaborative models for autonomous systems controller synthesis
- Verifying team formation protocols with probabilistic model checking
- Probabilistic model checking for energy-utility analysis
- A multi-objective approach for PH-graphs with applications to stochastic shortest paths
- Deniable Functional Encryption
- Exact quantitative probabilistic model checking through rational search
- Simple strategies in multi-objective MDPs
- Probabilistic black-box reachability checking (extended version)
- Correct probabilistic model checking with floating-point arithmetic
- Pareto curves for probabilistic model checking
- Multi-cost bounded tradeoff analysis in MDP
- Synthesis of covert actuator attackers for free
- Probabilistic timed automata with one clock and initialised clock-dependent probabilities
- Probabilistic timed automata with one clock and initialised clock-dependent probabilities
- Reformulation of the linear program for completely ergodic MDPs with average cost criteria
- Quantitative multi-objective verification for probabilistic systems
- Lifted model checking for relational MDPs
- Optimal schedulers vs optimal bases: an approach for efficient exact solving of Markov decision processes
- Advances in Quantitative Verification for Ubiquitous Computing
- Enhancing probabilistic model checking with ontologies
- Quantitative verification and strategy synthesis for stochastic games
- Computational Benefits of Intermediate Rewards for Goal-Reaching Policy Learning
- Trading performance for stability in Markov decision processes
- Automated verification and strategy synthesis for probabilistic systems
- Stochastic games with lexicographic objectives
- Error bounds for stochastic shortest path problems
- Synthesizing efficient systems in probabilistic environments
- Formal modelling and verification of probabilistic resource bounded agents
- Interval iteration algorithm for MDPs and IMDPs
- Farkas certificates and minimal witnesses for probabilistic reachability constraints
This page was built for publication: Quantitative multi-objective verification for probabilistic systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000641)
