A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
We study the existence of efficient approximation methods to verify quantitative specifications of probabilistic systems. Models of such systems are labelled discrete time Markov chains and checking specifications consists of computing satisfaction probabilities of linear temporal logic formulas. We prove that, in general, there is no polynomial time randomized approximation scheme with relative error for probabilistic verification. However, in many applications, specifications can be expresseddoi:10.1016/j.entcs.2005.05.031 fatcat:usjmmp4kjzdrnoztoxpskrguka