Counterexample-guided inductive synthesis for probabilistic systems
From MaRDI portal
Publication:1982641
DOI10.1007/s00165-021-00547-2OpenAlexW3163311278WikidataQ124796813 ScholiaQ124796813MaRDI QIDQ1982641
Milan Češka, Sebastian Junges, Christian Hensel, Joost-Pieter Katoen
Publication date: 14 September 2021
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00165-021-00547-2
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Planning and acting in partially observable stochastic domains
- Abstract probabilistic automata
- Minimal counterexamples for linear-time probabilistic verification
- Probabilistic mobile ambients
- A theory of formal synthesis via inductive learning
- Parameter synthesis for Markov models: faster than ever
- Syntax-guided optimal synthesis for chemical reaction networks
- More scalable LTL model checking via discovering design-space dependencies \((D^3)\)
- Reachability in augmented interval Markov chains
- Refinement checking on parametric modal transition systems
- Precise parameter synthesis for stochastic biochemical systems
- Optimizing synthesis with metasketches
- Dual-Priced Modal Transition Systems with Time Durations
- Minimal Critical Subsystems for Discrete-Time Markov Models
- Model Repair for Probabilistic Systems
- Model Checking Probabilistic Systems
- Fast Debugging of PRISM Models
- The Probabilistic Model Checking Landscape
- Counterexample Generation for Discrete-Time Markov Models: An Introductory Survey
- 30 Years of Modal Transition Systems: Survey of Extensions and Analysis
- High-level Counterexamples for Probabilistic Automata
- Bridging boolean and quantitative synthesis using smoothed proof search
- Safety-aware apprenticeship learning
- Counterexample guided inductive synthesis modulo theories
This page was built for publication: Counterexample-guided inductive synthesis for probabilistic systems
