From 4dd6a008d4a450c9b2ccadd38761e8c1eb233c61 Mon Sep 17 00:00:00 2001
From: Joachim Klein <klein@tcs.inf.tu-dresden.de>
Date: Wed, 10 Feb 2016 10:29:35 +0000
Subject: [PATCH] explicit.StateModelChecker: handleMaximalStateFormulas by
 recursive checking and attaching labels to the model

The labels encode the satisfaction sets of the subformulas. This method can be
used to do the standard PCTL* recursion step, i.e., computing Sat(phi) and replacing
phi with an atomic proposition a_phi in the formula.


git-svn-id: https://www.prismmodelchecker.org/svn/prism/prism/trunk@11167 bbc10eb1-c90d-0410-af57-cb519fbb1720
---
 prism/src/explicit/StateModelChecker.java | 39 +++++++++++++++++++++++
 1 file changed, 39 insertions(+)

diff --git a/prism/src/explicit/StateModelChecker.java b/prism/src/explicit/StateModelChecker.java
index 60b30891..6b8d828b 100644
--- a/prism/src/explicit/StateModelChecker.java
+++ b/prism/src/explicit/StateModelChecker.java
@@ -3,6 +3,7 @@
 //	Copyright (c) 2002-
 //	Authors:
 //	* Dave Parker <david.parker@comlab.ox.ac.uk> (University of Oxford)
+//	* Joachim Klein <klein@tcs.inf.tu-dresden.de> (TU Dresden)
 //	
 //------------------------------------------------------------------------------
 //	
@@ -35,6 +36,7 @@ import java.util.BitSet;
 import java.util.HashMap;
 import java.util.List;
 import java.util.Map;
+import java.util.Vector;
 
 import parser.State;
 import parser.Values;
@@ -60,6 +62,7 @@ import parser.type.TypeBool;
 import parser.type.TypeDouble;
 import parser.type.TypeInt;
 import parser.visitor.ASTTraverseModify;
+import parser.visitor.ReplaceLabels;
 import prism.Filter;
 import prism.ModelInfo;
 import prism.ModelType;
@@ -1094,6 +1097,42 @@ public class StateModelChecker extends PrismComponent
 		return resVals;
 	}
 
+	
+	/**
+	 * Method for handling the recursive part of PCTL* checking, i.e.,
+	 * recursively checking maximal state subformulas and replacing them
+	 * with labels and the corresponding satisfaction sets.
+	 * <br>
+	 * Extracts maximal state formula from an LTL path formula,
+	 * model checks them (with the current model checker) and
+	 * replaces them with ExpressionLabel objects that correspond
+	 * to freshly generated labels attached to the model.
+	 * <br>
+	 * Returns the modified Expression.
+	 */
+	public Expression handleMaximalStateFormulas(ModelExplicit model, Expression expr) throws PrismException
+	{
+		Vector<BitSet> labelBS = new Vector<BitSet>();
+
+		LTLModelChecker ltlMC = new LTLModelChecker(this);
+		// check the maximal state subformulas and gather
+		// the satisfaction sets in labelBS, with index i
+		// in the vector corresponding to label Li in the
+		// returned formula
+		Expression exprNew = ltlMC.checkMaximalStateFormulas(this, model, expr.deepCopy(), labelBS);
+
+		HashMap<String, String> labelReplacements = new HashMap<String, String>();
+		for (int i=0; i < labelBS.size(); i++) {
+			String currentLabel = "L"+i;
+			// Attach satisfaction set for Li to the model, record necessary
+			// label renaming
+			String newLabel = model.addUniqueLabel("phi", labelBS.get(i));
+			labelReplacements.put(currentLabel, newLabel);
+		}
+		// rename the labels
+		return (Expression) exprNew.accept(new ReplaceLabels(labelReplacements));
+	}
+
 	/**
 	 * Extract maximal propositional subformulas of an expression, model check them and
 	 * replace them with ExpressionLabel objects (L0, L1, etc.) Expression passed in is modified directly, but the result