Parameter synthesis for Markov models: faster than ever

DOI10.1007/978-3-319-46520-3_4zbMath1398.68346arXiv1602.05113OpenAlexW2284340808MaRDI QIDQ1990499

Sebastian Junges, Nils Jansen, Tim Quatmann, Christian Dehnert, Joost-Pieter Katoen

Publication date: 25 October 2018

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

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (22)

Synthesizing optimal bias in randomized self-stabilization ⋮ Parameter Synthesis Algorithms for Parametric Interval Markov Chains ⋮ Scenario-Based Verification of Uncertain MDPs ⋮ Tweaking the odds in probabilistic timed automata ⋮ Fine-tuning the odds in Bayesian networks ⋮ Gradient-descent for randomized controllers under partial observability ⋮ Out of control: reducing probabilistic models by control-state elimination ⋮ The complexity of reachability in parametric Markov decision processes ⋮ Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination ⋮ Parameter-Independent Strategies for pMDPs via POMDPs ⋮ Incremental Verification of Parametric and Reconfigurable Markov Chains ⋮ Parameter synthesis in Markov models: a gentle survey ⋮ POMDP controllers with optimal budget ⋮ Unnamed Item ⋮ Are Parametric Markov Chains Monotonic? ⋮ On the Complexity of Reachability in Parametric Markov Decision Processes ⋮ Sequential Convex Programming for the Efficient Verification of Parametric MDPs ⋮ Counterexample-guided inductive synthesis for probabilistic systems ⋮ Deniable Functional Encryption ⋮ Identity-Based Cryptosystems and Quadratic Residuosity ⋮ Finding provably optimal Markov chains ⋮ Inductive synthesis for probabilistic programs reaches new horizons

This page was built for publication: Parameter synthesis for Markov models: faster than ever