-
Selection by year
-
Selection by authors
-
Complete lists
NB-CSL12
N. Bertrand, J. Fearnley, S. Schewe. Bounded Satisfiability for PCTL. In proceedings of the 21st EACSL Annual Conferences on Computer Science Logic (CSL'12), LIPIcs, Pages 92-106, Fontainebleau, France, September 2012.
Download [help]
Download paper:
Doi page 
Download paper:
Adobe portable document (pdf) 
Copyright notice:
This material is presented to ensure timely dissemination of scholarly and
technical work. Copyright and all rights therein are retained by authors or
by other copyright holders. All persons copying this information are expected
to adhere to the terms and constraints invoked by each author's
copyright. These works may not be reposted without the explicit permission of
the copyright holder.
This page is automatically generated by bib2html v216, © INRIA 2002-2007, Projet Lagadic
Abstract
While model checking PCTL for Markov chains is decidable in polynomial-time, the decidability of PCTL satisfiability, as well as its finite model property, are long standing open problems. 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
Contact
Nathalie Bertrand http://www.irisa.fr/prive/nbertran/
BibTex Reference
@InProceedings{NB-CSL12,
Author = {Bertrand, N. and Fearnley, J. and Schewe, S.},
Title = {Bounded Satisfiability for PCTL},
BookTitle = {proceedings of the 21st EACSL Annual Conferences on Computer Science Logic (CSL'12)},
Number = {2},
Pages = {92--106},
Series = {LIPIcs},
Address = {Fontainebleau, France},
Month = {September},
Year = {2012}
}
EndNote Reference [help]
Get EndNote Reference (.ref)