Efficient sensitivity analysis for parametric robust Markov chains
From MaRDI portal
Publication:6535680
DOI10.1007/978-3-031-37709-9_4zbMATH Open1547.68406MaRDI QIDQ6535680FDOQ6535680
Ufuk Topcu, Sebastian Junges, Nils Jansen, Ahmadreza Marandi, Thom S. Badings
Publication date: 1 February 2024
Computational methods in Markov chains (60J22) Sensitivity, stability, parametric optimization (90C31) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Perturbation realization, potentials, and sensitivity analysis of Markov processes
- Smoothed model checking for uncertain continuous-time Markov chains
- Title not available (Why is that?)
- Theoretical Aspects of Computing - ICTAC 2004
- Title not available (Why is that?)
- From Bandits to Monte-Carlo Tree Search: The Optimistic Principle Applied to Optimization and Planning
- Smoothed perturbation analysis derivative estimation for Markov chains
- Tools and Algorithms for the Construction and Analysis of Systems
- Convex Optimization for Parameter Synthesis in MDPs
- Reachability in parametric interval Markov chains using constraints
- Reachability in augmented interval Markov chains
- The complexity of reachability in parametric Markov decision processes
- Distributionally Robust Convex Optimization
- Integer Programming
- Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination
- Scenario-Based Verification of Uncertain MDPs
- Parametric probabilistic transition systems for system design and analysis
- Integral Boundary Points of Convex Polyhedra
- Finding provably optimal Markov chains
- Title not available (Why is that?)
- Data-efficient Bayesian verification of parametric Markov chains
- Title not available (Why is that?)
- Parameter Synthesis for Parametric Interval Markov Chains
- Polynomial-Time Verification of PCTL Properties of MDPs with Convex Uncertainties
- Gradient-descent for randomized controllers under partial observability
- Perturbation Analysis in Verification of Discrete-Time Markov Chains
- Parameter Synthesis Algorithms for Parametric Interval Markov Chains
- Model-based Reinforcement Learning: A Survey
- PAC Statistical Model Checking of Mean Payoff in Discrete- and Continuous-Time MDP
- Abstraction-Refinement for Hierarchical Probabilistic Models
- PAC statistical model checking for Markov decision processes and stochastic games
- Parameter synthesis in Markov models: a gentle survey
This page was built for publication: Efficient sensitivity analysis for parametric robust Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535680)