From 41ba06191635874f4442d19371c7bdc141c8b8e0 Mon Sep 17 00:00:00 2001 From: Dave Parker Date: Mon, 16 Nov 2015 09:28:39 +0000 Subject: [PATCH] More output for multi-objective value iteration. git-svn-id: https://www.prismmodelchecker.org/svn/prism/prism/trunk@10881 bbc10eb1-c90d-0410-af57-cb519fbb1720 --- prism/src/prism/MultiObjModelChecker.java | 4 ++++ 1 file changed, 4 insertions(+) diff --git a/prism/src/prism/MultiObjModelChecker.java b/prism/src/prism/MultiObjModelChecker.java index bd5296e1..e6f76cb0 100644 --- a/prism/src/prism/MultiObjModelChecker.java +++ b/prism/src/prism/MultiObjModelChecker.java @@ -806,6 +806,7 @@ public class MultiObjModelChecker extends PrismComponent PrismNative.setExportAdv(Prism.EXPORT_ADV_NONE); for (int i = 0; i < dimProb; i++) { + mainLog.println("Computing maximum values for probability objective " + (i + 1) + "/" + dimProb); double[] result; double[] weights = new double[dimProb + dimReward]; @@ -826,10 +827,12 @@ public class MultiObjModelChecker extends PrismComponent throw new PrismException("The probabilistic objective number " + i + " is degenerate since the optimal value is also the least optimal value." ); */ targetPoint = new Point(result); + mainLog.println("Computed point: " + targetPoint); pointsForInitialTile.add(targetPoint); } for (int i = 0; i < dimReward; i++) { + mainLog.println("Computing maximum values for reward objective " + (i + 1) + "/" + dimProb); if (verbose) { mainLog.println("Getting an upper bound on maximizing objective " + i); } @@ -849,6 +852,7 @@ public class MultiObjModelChecker extends PrismComponent numberOfPoints++; targetPoint = new Point(result); + mainLog.println("Computed point: " + targetPoint); pointsForInitialTile.add(targetPoint); if (verbose) {