Finding provably optimal Markov chains
From MaRDI portal
Publication:2044197
DOI10.1007/978-3-030-72016-2_10zbMath1467.68095OpenAlexW3137643797MaRDI QIDQ2044197
Sebastian Junges, Jip Spel, Joost-Pieter Katoen
Publication date: 4 August 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-72016-2_10
Computational methods in Markov chains (60J22) Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (3)
Fine-tuning the odds in Bayesian networks ⋮ Parameter synthesis in Markov models: a gentle survey ⋮ POMDP controllers with optimal budget
Cites Work
- Unnamed Item
- Parametric probabilistic transition systems for system design and analysis
- Interval-valued finite Markov chains
- Verification and control of partially observable probabilistic systems
- Parameter synthesis for Markov models: faster than ever
- Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination
- Precise parameter synthesis for stochastic biochemical systems
- The complexity of reachability in parametric Markov decision processes
- Attaining Monotonicity for Bayesian Networks
- Model Checking Probabilistic Systems
- Are Parametric Markov Chains Monotonic?
- Sequential Convex Programming for the Efficient Verification of Parametric MDPs
- The Probabilistic Model Checking Landscape
- Theoretical Aspects of Computing - ICTAC 2004
- Synthesis in pMDPs: a tale of 1001 parameters
- Accelerated model checking of parametric Markov chains
This page was built for publication: Finding provably optimal Markov chains
