@InProceedings{bertrand_et_al:LIPIcs.CSL.2012.92,
author = {Bertrand, Nathalie and Fearnley, John and Schewe, Sven},
title = {{Bounded Satisfiability for PCTL}},
booktitle = {Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
pages = {92--106},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-42-2},
ISSN = {1868-8969},
year = {2012},
volume = {16},
editor = {C\'{e}gielski, Patrick and Durand, Arnaud},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.92},
URN = {urn:nbn:de:0030-drops-36667},
doi = {10.4230/LIPIcs.CSL.2012.92},
annote = {Keywords: Satisfiability, Temporal Logic, Probabilistic Logic}
}