License
when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CSL.2012.92
URN: urn:nbn:de:0030-drops-36667
URL: http://drops.dagstuhl.de/opus/volltexte/2012/3666/

Bertrand, Nathalie ; Fearnley, John ; Schewe, Sven

Bounded Satisfiability for PCTL

pdf-format:
Dokument 1.pdf (502 KB)


Abstract

While model checking PCTL for Markov chains is decidable in polynomial-time, the decidability of PCTL satisfiability is a long standing open problem. While general satisfiability is an intriguing challenge from a purely theoretical point of view, we argue that general solutions would not be of interest to practitioners: such solutions could be too big to be implementable or even infinite. Inspired by bounded synthesis techniques, we turn to the more applied problem of seeking models of a bounded size: we restrict our search to implementable - and therefore reasonably simple - models. We propose a procedure to decide whether or not a given PCTL formula has an implementable model by reducing it to an SMT problem. We have implemented our techniques and found that they can be applied to the practical problem of sanity checking - a procedure that allows a system designer to check whether their formula has an unexpectedly small model.

BibTeX - Entry

@InProceedings{bertrand_et_al:LIPIcs:2012:3666,
  author =	{Nathalie Bertrand and John Fearnley and Sven Schewe},
  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 =	{Patrick C{\'e}gielski and Arnaud Durand},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2012/3666},
  URN =		{urn:nbn:de:0030-drops-36667},
  doi =		{http://dx.doi.org/10.4230/LIPIcs.CSL.2012.92},
  annote =	{Keywords: Satisfiability, Temporal Logic, Probabilistic Logic}
}

Keywords: Satisfiability, Temporal Logic, Probabilistic Logic
Seminar: Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL
Issue date: 2012
Date of publication: 27.08.2012


DROPS-Home | Fulltext Search | Imprint Published by LZI