Farkas certificates and minimal witnesses for probabilistic reachability constraints

DOI10.1007/978-3-030-45190-5_18zbMath1507.68187arXiv1910.10636MaRDI QIDQ6327764

Simon Jantsch, Christel Baier, Florian Funke

Publication date: 23 October 2019

Mathematics Subject Classification ID

Markov and semi-Markov decision processes (90C40) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: Farkas certificates and minimal witnesses for probabilistic reachability constraints