On the Hardness of PCTL Satisfiability release_l47flsf5qzdbfh3v6twvtmmv4i

by Souymodip Chakraborty, Joost-Pieter Katoen

Released as a article .

2015  

Abstract

This paper shows that the satisfiability problem for probabilistic CTL (PCTL, for short) is undecidable. By a reduction from 11/2-player games with PCTL winning objectives, we establish that the PCTL satisfiability problem is Σ_1^1-hard. We present an exponential-time algorithm for the satisfiability of a bounded, negation-closed fragment of PCTL, and show that the satisfiability problem for this fragment is EXPTIME-hard.
In text/plain format

Archived Content

There are no accessible files associated with this release. You could check other releases for this work for an accessible version.

"Dark" Preservation Only
Save Paper Now!

Know of a fulltext copy of on the public web? Submit a URL and we will archive it

Type  article
Stage   submitted
Date   2015-11-29
Version   v3
Language   en ?
arXiv  1506.02483v3
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 623545bb-df8a-46a6-812d-8f8f021d605a
API URL: JSON