Synthesis in pMDPs: a tale of 1001 parameters

DOI10.1007/978-3-030-01090-4_10zbMath1517.68227arXiv1803.02884OpenAlexW2963307044MaRDI QIDQ6109587

Ufuk Topcu, Sebastian Junges, Nils Jansen, Joost-Pieter Katoen, Murat Cubuktepe

Publication date: 28 July 2023

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1803.02884

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Markov and semi-Markov decision processes (90C40) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (9)

Tweaking the odds in probabilistic timed automata ⋮ Fine-tuning the odds in Bayesian networks ⋮ Gradient-descent for randomized controllers under partial observability ⋮ The complexity of reachability in parametric Markov decision processes ⋮ Parameter synthesis in Markov models: a gentle survey ⋮ Are Parametric Markov Chains Monotonic? ⋮ On the Complexity of Reachability in Parametric Markov Decision Processes ⋮ Finding provably optimal Markov chains ⋮ Encoding inductive invariants as barrier certificates: synthesis via difference-of-convex programming

This page was built for publication: Synthesis in pMDPs: a tale of 1001 parameters