Inductive synthesis for probabilistic programs reaches new horizons
From MaRDI portal
Publication:2044199
DOI10.1007/978-3-030-72016-2_11zbMath1467.68035arXiv2101.12683OpenAlexW3142023506MaRDI QIDQ2044199
Sebastian Junges, Milan Češka, Roman Andriushchenko, Joost-Pieter Katoen
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/2101.12683
Computational methods in Markov chains (60J22) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (2)
Gradient-descent for randomized controllers under partial observability ⋮ Parameter synthesis in Markov models: a gentle survey
Cites Work
- Unnamed Item
- Unnamed Item
- Probabilistic self-stabilization
- Abstract model repair for probabilistic systems
- Probabilistic verification of Herman's self-stabilisation algorithm
- Parameter synthesis for Markov models: faster than ever
- Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination
- Reachability in augmented interval Markov chains
- Precise parameter synthesis for stochastic biochemical systems
- Optimizing synthesis with metasketches
- A Concise Introduction to Decentralized POMDPs
- Model Repair for Probabilistic Systems
- Model Checking Probabilistic Systems
- Fast Debugging of PRISM Models
- Farkas Certificates and Minimal Witnesses for Probabilistic Reachability Constraints
- Counterexample Generation for Discrete-Time Markov Models: An Introductory Survey
- High-level Counterexamples for Probabilistic Automata
- Theoretical Aspects of Computing - ICTAC 2004
This page was built for publication: Inductive synthesis for probabilistic programs reaches new horizons
