Counterexample-guided inductive synthesis for probabilistic systems

This paper presents counterexample-guided inductive synthesis (CEGIS) to automatically synthesise probabilistic models. The starting point is a family of finite-stateMarkov chains with related but distinct topologies. Such families can succinctly be described by a sketch of a probabilistic program....

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Formal aspects of computing 2021-08, Vol.33 (4-5), p.637-667
Hauptverfasser:	Češka, Milan, Hensel, Christian, Junges, Sebastian, Katoen, Joost-Pieter
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science Feasibility studies Markov chains Math Applications in Computer Science Original Article Partitioning Probabilistic models Sketches Statistical analysis Synthesis Theory of Computation Topology
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!