diff --git a/prism/src/explicit/CTMDPModelChecker.java b/prism/src/explicit/CTMDPModelChecker.java
index 2e5b9cd7..9e8b630c 100644
--- a/prism/src/explicit/CTMDPModelChecker.java
+++ b/prism/src/explicit/CTMDPModelChecker.java
@@ -36,36 +36,6 @@ import prism.PrismException;
  */
 public class CTMDPModelChecker extends MDPModelChecker
 {
-	/**
-	 * Compute bounded probabilistic reachability.
-	 * @param target: Target states
-	 * @param t: Time bound
-	 * @param min: Min or max probabilities for (true=min, false=max)
-	 * @param init: Initial solution vector - pass null for default
-	 * @param results: Optional array of size b+1 to store (init state) results for each step (null if unused)
-	 */
-	public ModelCheckerResult probReachBounded2(CTMDP ctmdp, BitSet target, double t, boolean min, double init[],
-			double results[]) throws PrismException
-	{
-		MDP mdp;
-		MDPModelChecker mc;
-		ModelCheckerResult res;
-		
-		// TODO: check locally uniform
-		double epsilon = 1e-3;
-		double q = ctmdp.getMaxExitRate();
-		int k = (int)Math.ceil((q * t * q * t) / (2 * epsilon));
-		double tau = t / k;
-		mainLog.println("q = " + q + ", k = " + k + ", tau = " + tau);
-		mdp = ctmdp.buildDiscretisedMDP(tau);
-		mainLog.println(mdp);
-		mc = new MDPModelChecker();
-		mc.inheritSettings(this);
-		res = mc.probReachBounded(mdp, target, k, min);
-		
-		return res;
-	}
-	
 	/**
 	 * Compute bounded probabilistic reachability.
 	 * @param target: Target states
@@ -77,132 +47,6 @@ public class CTMDPModelChecker extends MDPModelChecker
 	public ModelCheckerResult probReachBounded(CTMDP ctmdp, BitSet target, double t, boolean min, double init[],
 			double results[]) throws PrismException
 	{
-		ModelCheckerResult res = null;
-		int i, n, iters;
-		double  soln[], soln2[], tmpsoln[], sum[];
-		long timer;
-		// Fox-Glynn stuff
-		FoxGlynn fg;
-		int left, right;
-		double q, qt, weights[], totalWeight;
-
-		// Start bounded probabilistic reachability
-		timer = System.currentTimeMillis();
-		mainLog.println("Starting time-bounded probabilistic reachability...");
-
-		// Store num states
-		n = ctmdp.getNumStates();
-
-		// Get uniformisation rate; do Fox-Glynn
-		q = 99;//ctmdp.unif;
-		qt = q * t;
-		mainLog.println("\nUniformisation: q.t = " + q + " x " + t + " = " + qt);
-		fg = new FoxGlynn(qt, 1e-300, 1e+300, termCritParam / 8.0);
-		left = fg.getLeftTruncationPoint();
-		right = fg.getRightTruncationPoint();
-		if (right < 0) {
-			throw new PrismException("Overflow in Fox-Glynn computation (time bound too big?)");
-		}
-		weights = fg.getWeights();
-		totalWeight = fg.getTotalWeight();
-		for (i = left; i <= right; i++) {
-			weights[i - left] /= totalWeight;
-		}
-		mainLog.println("Fox-Glynn: left = "+left+", right = "+right);
-
-		// Create solution vector(s)
-		soln = new double[n];
-		soln2 = (init == null) ? new double[n] : init;
-		sum = new double[n];
-
-		// Initialise solution vectors. Use passed in initial vector, if present
-		if (init != null) {
-			for (i = 0; i < n; i++)
-				soln[i] = soln2[i] = target.get(i) ? 1.0 : init[i];
-		} else {
-			for (i = 0; i < n; i++)
-				soln[i] = soln2[i] = target.get(i) ? 1.0 : 0.0;
-		}
-		for (i = 0; i < n; i++)
-			sum[i] = 0.0;
-		
-		// If necessary, do 0th element of summation (doesn't require any matrix powers)
-		if (left == 0)
-			for (i = 0; i < n; i++)
-				sum[i] += weights[0] * soln[i];
-		
-		// Start iterations
-		iters = 1;
-		while (iters <= right) {
-			// Matrix-vector multiply and min/max ops
-			ctmdp.mvMultMinMax(soln, min, soln2, target, true);
-			// Since is globally uniform, can do this? and more?
-			for (i = 0; i < n; i++)
-				soln2[i] /= q;
-			// Store intermediate results if required
-			// TODO?
-			// Swap vectors for next iter
-			tmpsoln = soln;
-			soln = soln2;
-			soln2 = tmpsoln;
-			// Add to sum
-			if (iters >= left) {
-				for (i = 0; i < n; i++)
-					sum[i] += weights[iters-left] * soln[i];
-			}
-			iters++;
-		}
-
-		// Print vector (for debugging)
-		mainLog.println(sum);
-
-		// Finished bounded probabilistic reachability
-		timer = System.currentTimeMillis() - timer;
-		mainLog.print("Time-bounded probabilistic reachability (" + (min ? "min" : "max") + ")");
-		mainLog.println(" took " + iters + " iters and " + timer / 1000.0 + " seconds.");
-
-		// Return results
-		res = new ModelCheckerResult();
-		res.soln = sum;
-		res.lastSoln = soln2;
-		res.numIters = iters;
-		res.timeTaken = timer / 1000.0;
-		return res;
-	}
-	
-	/**
-	 * Simple test program.
-	 */
-	public static void main(String args[])
-	{
-		CTMDPModelChecker mc;
-		CTMDPSimple ctmdp;
-		ModelCheckerResult res;
-		BitSet target;
-		Map<String, BitSet> labels;
-		boolean min = true;
-		try {
-			mc = new CTMDPModelChecker();
-			ctmdp = new CTMDPSimple();
-			ctmdp.buildFromPrismExplicit(args[0]);
-			System.out.println(ctmdp);
-			labels = mc.loadLabelsFile(args[1]);
-			System.out.println(labels);
-			target = labels.get(args[2]);
-			if (target == null)
-				throw new PrismException("Unknown label \"" + args[2] + "\"");
-			for (int i = 4; i < args.length; i++) {
-				if (args[i].equals("-min"))
-					min = true;
-				else if (args[i].equals("-max"))
-					min = false;
-				else if (args[i].equals("-nopre"))
-					mc.setPrecomp(false);
-			}
-			res = mc.probReachBounded2(ctmdp, target, Double.parseDouble(args[3]), min, null, null);
-			System.out.println(res.soln[0]);
-		} catch (PrismException e) {
-			System.out.println(e);
-		}
+		throw new PrismException("Not supported");
 	}
 }