High-level Counterexamples for Probabilistic Automata

DOI10.2168/LMCS-11(1:15)2015zbMath1347.68211arXiv1305.5055WikidataQ57800674 ScholiaQ57800674MaRDI QIDQ5246720

Nils Jansen, Ralf Wimmer, Erika Ábrahám, Joost-Pieter Katoen

Publication date: 22 April 2015

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1305.5055

zbMATH Keywords

mixed integer linear programmingcounterexamplesprobabilistic automataguarded command language

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Mixed integer programming (90C11) Formal languages and automata (68Q45)

Related Items (3)

Counterexample-guided inductive synthesis for probabilistic systems ⋮ Inductive synthesis for probabilistic programs reaches new horizons ⋮ Unnamed Item

Uses Software

• SCIP
• PRISM
• Gurobi

This page was built for publication: High-level Counterexamples for Probabilistic Automata