|
|
|
@ -35,132 +35,350 @@ import mtbdd.*; |
|
|
|
import parser.*; |
|
|
|
import sparse.*; |
|
|
|
|
|
|
|
// class to store an instance of a fully probabilistic model (mtbdds) |
|
|
|
|
|
|
|
/* |
|
|
|
* Class to store a PRISM model which is a DTMC |
|
|
|
*/ |
|
|
|
public class ProbModel implements Model |
|
|
|
{ |
|
|
|
// model info |
|
|
|
|
|
|
|
// type |
|
|
|
private static final String type = "Probabilistic (DTMC)"; |
|
|
|
// modules |
|
|
|
private int numModules; // number of modules |
|
|
|
private String[] moduleNames; // module names |
|
|
|
protected int numModules; // number of modules |
|
|
|
protected String[] moduleNames; // module names |
|
|
|
// vars/consts |
|
|
|
private int numVars; // total number of module variables |
|
|
|
private VarList varList; // list of module variables |
|
|
|
private long[] gtol; // numbers for use by globalToLocal |
|
|
|
private Values constantValues; // values of constants |
|
|
|
protected int numVars; // total number of module variables |
|
|
|
protected VarList varList; // list of module variables |
|
|
|
protected long[] gtol; // numbers for use by globalToLocal |
|
|
|
protected Values constantValues; // values of constants |
|
|
|
// rewards |
|
|
|
private int numRewardStructs; // number of reward structs |
|
|
|
private String[] rewardStructNames; // reward struct names |
|
|
|
protected int numRewardStructs; // number of reward structs |
|
|
|
protected String[] rewardStructNames; // reward struct names |
|
|
|
// stats |
|
|
|
private double numStates; // number of states |
|
|
|
private double numTransitions; // number of transitions |
|
|
|
private double numStartStates; // number of initial states |
|
|
|
protected double numStates; // number of states |
|
|
|
protected double numTransitions; // number of transitions |
|
|
|
protected double numStartStates; // number of initial states |
|
|
|
// reachable state list |
|
|
|
private StateListMTBDD reachStateList = null; |
|
|
|
protected StateListMTBDD reachStateList = null; |
|
|
|
// deadlock state list |
|
|
|
private StateListMTBDD deadlockStateList = null; |
|
|
|
protected StateListMTBDD deadlockStateList = null; |
|
|
|
// initial state list |
|
|
|
private StateListMTBDD startStateList = null; |
|
|
|
protected StateListMTBDD startStateList = null; |
|
|
|
|
|
|
|
// mtbdd stuff |
|
|
|
|
|
|
|
// dds |
|
|
|
|
|
|
|
private JDDNode trans; // transition matrix dd |
|
|
|
private JDDNode trans01; // 0-1 transition matrix dd |
|
|
|
private JDDNode start; // start state dd |
|
|
|
private JDDNode reach; // reachable states dd |
|
|
|
private JDDNode deadlocks; // deadlock states dd |
|
|
|
private JDDNode fixdl; // fixed deadlock states dd |
|
|
|
private JDDNode stateRewards[]; // state rewards dds |
|
|
|
private JDDNode transRewards[]; // transition rewards dds |
|
|
|
protected JDDNode trans; // transition matrix dd |
|
|
|
protected JDDNode trans01; // 0-1 transition matrix dd |
|
|
|
protected JDDNode start; // start state dd |
|
|
|
protected JDDNode reach; // reachable states dd |
|
|
|
protected JDDNode deadlocks; // deadlock states dd |
|
|
|
protected JDDNode fixdl; // fixed deadlock states dd |
|
|
|
protected JDDNode stateRewards[]; // state rewards dds |
|
|
|
protected JDDNode transRewards[]; // transition rewards dds |
|
|
|
// dd vars |
|
|
|
private JDDVars[] varDDRowVars; // dd vars for each module variable (rows) |
|
|
|
private JDDVars[] varDDColVars; // dd vars for each module variable (cols) |
|
|
|
private JDDVars[] moduleDDRowVars; // dd vars for each module (rows) |
|
|
|
private JDDVars[] moduleDDColVars; // dd vars for each module (cols) |
|
|
|
private JDDVars allDDRowVars; // all dd vars (rows) |
|
|
|
private JDDVars allDDColVars; // all dd vars (cols) |
|
|
|
protected JDDVars[] varDDRowVars; // dd vars for each module variable (rows) |
|
|
|
protected JDDVars[] varDDColVars; // dd vars for each module variable (cols) |
|
|
|
protected JDDVars[] moduleDDRowVars; // dd vars for each module (rows) |
|
|
|
protected JDDVars[] moduleDDColVars; // dd vars for each module (cols) |
|
|
|
protected JDDVars allDDRowVars; // all dd vars (rows) |
|
|
|
protected JDDVars allDDColVars; // all dd vars (cols) |
|
|
|
// names for all dd vars used |
|
|
|
private Vector ddVarNames; |
|
|
|
protected Vector ddVarNames; |
|
|
|
|
|
|
|
private ODDNode odd; // odd |
|
|
|
protected ODDNode odd; // odd |
|
|
|
|
|
|
|
// accessor methods |
|
|
|
|
|
|
|
// model info |
|
|
|
|
|
|
|
// type |
|
|
|
public String getType() { return type; } |
|
|
|
public int getType() |
|
|
|
{ |
|
|
|
return Model.DTMC; |
|
|
|
} |
|
|
|
|
|
|
|
public String getTypeString() |
|
|
|
{ |
|
|
|
return "Probabilistic (DTMC)"; // TODO: Change this after regression testing |
|
|
|
//return "DTMC"; |
|
|
|
} |
|
|
|
|
|
|
|
// modules |
|
|
|
public int getNumModules() { return numModules; } |
|
|
|
public String[] getModuleNames() { return moduleNames; } |
|
|
|
public String getModuleName(int i) { return moduleNames[i]; } |
|
|
|
public int getNumModules() |
|
|
|
{ |
|
|
|
return numModules; |
|
|
|
} |
|
|
|
|
|
|
|
public String[] getModuleNames() |
|
|
|
{ |
|
|
|
return moduleNames; |
|
|
|
} |
|
|
|
|
|
|
|
public String getModuleName(int i) |
|
|
|
{ |
|
|
|
return moduleNames[i]; |
|
|
|
} |
|
|
|
|
|
|
|
// vars |
|
|
|
public int getNumVars() { return numVars; } |
|
|
|
public VarList getVarList() { return varList; } |
|
|
|
public String getVarName(int i) { return varList.getName(i); } |
|
|
|
public int getVarIndex(String n) { return varList.getIndex(n); } |
|
|
|
public int getVarModule(int i) { return varList.getModule(i); } |
|
|
|
public int getVarLow(int i) { return varList.getLow(i); } |
|
|
|
public int getVarHigh(int i) { return varList.getHigh(i); } |
|
|
|
public int getVarRange(int i) { return varList.getRange(i); } |
|
|
|
public Values getConstantValues() { return constantValues; } |
|
|
|
public int getNumVars() |
|
|
|
{ |
|
|
|
return numVars; |
|
|
|
} |
|
|
|
|
|
|
|
public VarList getVarList() |
|
|
|
{ |
|
|
|
return varList; |
|
|
|
} |
|
|
|
|
|
|
|
public String getVarName(int i) |
|
|
|
{ |
|
|
|
return varList.getName(i); |
|
|
|
} |
|
|
|
|
|
|
|
public int getVarIndex(String n) |
|
|
|
{ |
|
|
|
return varList.getIndex(n); |
|
|
|
} |
|
|
|
|
|
|
|
public int getVarModule(int i) |
|
|
|
{ |
|
|
|
return varList.getModule(i); |
|
|
|
} |
|
|
|
|
|
|
|
public int getVarLow(int i) |
|
|
|
{ |
|
|
|
return varList.getLow(i); |
|
|
|
} |
|
|
|
|
|
|
|
public int getVarHigh(int i) |
|
|
|
{ |
|
|
|
return varList.getHigh(i); |
|
|
|
} |
|
|
|
|
|
|
|
public int getVarRange(int i) |
|
|
|
{ |
|
|
|
return varList.getRange(i); |
|
|
|
} |
|
|
|
|
|
|
|
public Values getConstantValues() |
|
|
|
{ |
|
|
|
return constantValues; |
|
|
|
} |
|
|
|
|
|
|
|
// rewards |
|
|
|
public int getNumRewardStructs() { return numRewardStructs; } |
|
|
|
public int getNumRewardStructs() |
|
|
|
{ |
|
|
|
return numRewardStructs; |
|
|
|
} |
|
|
|
|
|
|
|
// stats |
|
|
|
public long getNumStates() { return (numStates>Long.MAX_VALUE) ? -1 : Math.round(numStates); } |
|
|
|
public long getNumTransitions() { return (numTransitions>Long.MAX_VALUE) ? -1 : Math.round(numTransitions); } |
|
|
|
public long getNumStartStates() { return (numStartStates>Long.MAX_VALUE) ? -1 : Math.round(numStartStates); } |
|
|
|
public long getNumStates() |
|
|
|
{ |
|
|
|
return (numStates > Long.MAX_VALUE) ? -1 : Math.round(numStates); |
|
|
|
} |
|
|
|
|
|
|
|
public long getNumTransitions() |
|
|
|
{ |
|
|
|
return (numTransitions > Long.MAX_VALUE) ? -1 : Math.round(numTransitions); |
|
|
|
} |
|
|
|
|
|
|
|
public long getNumStartStates() |
|
|
|
{ |
|
|
|
return (numStartStates > Long.MAX_VALUE) ? -1 : Math.round(numStartStates); |
|
|
|
} |
|
|
|
|
|
|
|
// additional methods to get stats as strings |
|
|
|
public String getNumStatesString() { return PrismUtils.bigIntToString(numStates); } |
|
|
|
public String getNumTransitionsString() { return PrismUtils.bigIntToString(numTransitions); } |
|
|
|
public String getNumStartStatesString() { return PrismUtils.bigIntToString(numStartStates); } |
|
|
|
public String getNumStatesString() |
|
|
|
{ |
|
|
|
return PrismUtils.bigIntToString(numStates); |
|
|
|
} |
|
|
|
|
|
|
|
public String getNumTransitionsString() |
|
|
|
{ |
|
|
|
return PrismUtils.bigIntToString(numTransitions); |
|
|
|
} |
|
|
|
|
|
|
|
public String getNumStartStatesString() |
|
|
|
{ |
|
|
|
return PrismUtils.bigIntToString(numStartStates); |
|
|
|
} |
|
|
|
|
|
|
|
// lists of states |
|
|
|
public StateList getReachableStates() { return reachStateList; } |
|
|
|
public StateList getDeadlockStates() { return deadlockStateList; } |
|
|
|
public StateList getStartStates() { return startStateList; } |
|
|
|
public StateList getReachableStates() |
|
|
|
{ |
|
|
|
return reachStateList; |
|
|
|
} |
|
|
|
|
|
|
|
public StateList getDeadlockStates() |
|
|
|
{ |
|
|
|
return deadlockStateList; |
|
|
|
} |
|
|
|
|
|
|
|
public StateList getStartStates() |
|
|
|
{ |
|
|
|
return startStateList; |
|
|
|
} |
|
|
|
|
|
|
|
// mtbdd stuff |
|
|
|
|
|
|
|
public JDDNode getTrans() { return trans; } |
|
|
|
public JDDNode getTrans01() { return trans01; } |
|
|
|
public JDDNode getStart() { return start; } |
|
|
|
public JDDNode getReach() { return reach; } |
|
|
|
public JDDNode getDeadlocks() { return deadlocks; } |
|
|
|
public JDDNode getFixedDeadlocks() { return fixdl; } |
|
|
|
public JDDNode getStateRewards() { return getStateRewards(0); } |
|
|
|
public JDDNode getStateRewards(int i) { return (i>=0&&i<numRewardStructs) ? stateRewards[i] : null; } |
|
|
|
public JDDNode getStateRewards(String s) { for (int i=0;i<numRewardStructs;i++) if (rewardStructNames[i].equals(s)) return stateRewards[i]; return null; } |
|
|
|
public JDDNode getTransRewards() { return getTransRewards(0); } |
|
|
|
public JDDNode getTransRewards(int i) { return (i>=0&&i<numRewardStructs) ? transRewards[i] : null; } |
|
|
|
public JDDNode getTransRewards(String s) { for (int i=0;i<numRewardStructs;i++) if (rewardStructNames[i].equals(s)) return transRewards[i]; return null; } |
|
|
|
public JDDNode getTrans() |
|
|
|
{ |
|
|
|
return trans; |
|
|
|
} |
|
|
|
|
|
|
|
public JDDNode getTrans01() |
|
|
|
{ |
|
|
|
return trans01; |
|
|
|
} |
|
|
|
|
|
|
|
public JDDNode getStart() |
|
|
|
{ |
|
|
|
return start; |
|
|
|
} |
|
|
|
|
|
|
|
public JDDNode getReach() |
|
|
|
{ |
|
|
|
return reach; |
|
|
|
} |
|
|
|
|
|
|
|
public JDDNode getDeadlocks() |
|
|
|
{ |
|
|
|
return deadlocks; |
|
|
|
} |
|
|
|
|
|
|
|
public JDDNode getFixedDeadlocks() |
|
|
|
{ |
|
|
|
return fixdl; |
|
|
|
} |
|
|
|
|
|
|
|
public JDDNode getStateRewards() |
|
|
|
{ |
|
|
|
return getStateRewards(0); |
|
|
|
} |
|
|
|
|
|
|
|
public JDDNode getStateRewards(int i) |
|
|
|
{ |
|
|
|
return (i >= 0 && i < numRewardStructs) ? stateRewards[i] : null; |
|
|
|
} |
|
|
|
|
|
|
|
public JDDNode getStateRewards(String s) |
|
|
|
{ |
|
|
|
for (int i = 0; i < numRewardStructs; i++) |
|
|
|
if (rewardStructNames[i].equals(s)) |
|
|
|
return stateRewards[i]; |
|
|
|
return null; |
|
|
|
} |
|
|
|
|
|
|
|
public JDDNode getTransRewards() |
|
|
|
{ |
|
|
|
return getTransRewards(0); |
|
|
|
} |
|
|
|
|
|
|
|
public JDDNode getTransRewards(int i) |
|
|
|
{ |
|
|
|
return (i >= 0 && i < numRewardStructs) ? transRewards[i] : null; |
|
|
|
} |
|
|
|
|
|
|
|
public JDDNode getTransRewards(String s) |
|
|
|
{ |
|
|
|
for (int i = 0; i < numRewardStructs; i++) |
|
|
|
if (rewardStructNames[i].equals(s)) |
|
|
|
return transRewards[i]; |
|
|
|
return null; |
|
|
|
} |
|
|
|
|
|
|
|
// dd vars |
|
|
|
public JDDVars[] getVarDDRowVars() { return varDDRowVars; } |
|
|
|
public JDDVars[] getVarDDColVars() { return varDDColVars; } |
|
|
|
public JDDVars getVarDDRowVars(int i) { return varDDRowVars[i]; } |
|
|
|
public JDDVars getVarDDColVars(int i) { return varDDColVars[i]; } |
|
|
|
public JDDVars[] getModuleDDRowVars() { return moduleDDRowVars; } |
|
|
|
public JDDVars[] getModuleDDColVars() { return moduleDDColVars; } |
|
|
|
public JDDVars getModuleDDRowVars(int i) { return moduleDDRowVars[i]; } |
|
|
|
public JDDVars getModuleDDColVars(int i) { return moduleDDColVars[i]; } |
|
|
|
public JDDVars getAllDDRowVars() { return allDDRowVars; } |
|
|
|
public JDDVars getAllDDColVars() { return allDDColVars; } |
|
|
|
public JDDVars[] getVarDDRowVars() |
|
|
|
{ |
|
|
|
return varDDRowVars; |
|
|
|
} |
|
|
|
|
|
|
|
public JDDVars[] getVarDDColVars() |
|
|
|
{ |
|
|
|
return varDDColVars; |
|
|
|
} |
|
|
|
|
|
|
|
public JDDVars getVarDDRowVars(int i) |
|
|
|
{ |
|
|
|
return varDDRowVars[i]; |
|
|
|
} |
|
|
|
|
|
|
|
public JDDVars getVarDDColVars(int i) |
|
|
|
{ |
|
|
|
return varDDColVars[i]; |
|
|
|
} |
|
|
|
|
|
|
|
public JDDVars[] getModuleDDRowVars() |
|
|
|
{ |
|
|
|
return moduleDDRowVars; |
|
|
|
} |
|
|
|
|
|
|
|
public JDDVars[] getModuleDDColVars() |
|
|
|
{ |
|
|
|
return moduleDDColVars; |
|
|
|
} |
|
|
|
|
|
|
|
public JDDVars getModuleDDRowVars(int i) |
|
|
|
{ |
|
|
|
return moduleDDRowVars[i]; |
|
|
|
} |
|
|
|
|
|
|
|
public JDDVars getModuleDDColVars(int i) |
|
|
|
{ |
|
|
|
return moduleDDColVars[i]; |
|
|
|
} |
|
|
|
|
|
|
|
public JDDVars getAllDDRowVars() |
|
|
|
{ |
|
|
|
return allDDRowVars; |
|
|
|
} |
|
|
|
|
|
|
|
public JDDVars getAllDDColVars() |
|
|
|
{ |
|
|
|
return allDDColVars; |
|
|
|
} |
|
|
|
|
|
|
|
// additional useful methods to do with dd vars |
|
|
|
public int getNumDDRowVars() { return allDDRowVars.n(); } |
|
|
|
public int getNumDDColVars() { return allDDColVars.n(); } |
|
|
|
public int getNumDDVarsInTrans() { return allDDRowVars.n()*2; } |
|
|
|
public Vector getDDVarNames() { return ddVarNames; } |
|
|
|
public int getNumDDRowVars() |
|
|
|
{ |
|
|
|
return allDDRowVars.n(); |
|
|
|
} |
|
|
|
|
|
|
|
public ODDNode getODD() { return odd; } |
|
|
|
public int getNumDDColVars() |
|
|
|
{ |
|
|
|
return allDDColVars.n(); |
|
|
|
} |
|
|
|
|
|
|
|
public int getNumDDVarsInTrans() |
|
|
|
{ |
|
|
|
return allDDRowVars.n() * 2; |
|
|
|
} |
|
|
|
|
|
|
|
public Vector getDDVarNames() |
|
|
|
{ |
|
|
|
return ddVarNames; |
|
|
|
} |
|
|
|
|
|
|
|
public ODDNode getODD() |
|
|
|
{ |
|
|
|
return odd; |
|
|
|
} |
|
|
|
|
|
|
|
public String getTransName() |
|
|
|
{ |
|
|
|
return "Transition matrix"; |
|
|
|
} |
|
|
|
|
|
|
|
public String getTransSymbol() |
|
|
|
{ |
|
|
|
return "P"; |
|
|
|
} |
|
|
|
|
|
|
|
// constructor |
|
|
|
|
|
|
|
public ProbModel(JDDNode tr, JDDNode tr01, JDDNode s, JDDNode r, JDDNode dl, JDDNode sr[], JDDNode trr[], String rsn[], JDDVars arv, JDDVars acv, Vector ddvn, |
|
|
|
int nm, String[] mn, JDDVars[] mrv, JDDVars[] mcv, |
|
|
|
public ProbModel(JDDNode tr, JDDNode tr01, JDDNode s, JDDNode r, JDDNode dl, JDDNode sr[], JDDNode trr[], |
|
|
|
String rsn[], JDDVars arv, JDDVars acv, Vector ddvn, int nm, String[] mn, JDDVars[] mrv, JDDVars[] mcv, |
|
|
|
int nv, VarList vl, JDDVars[] vrv, JDDVars[] vcv, Values cv) |
|
|
|
{ |
|
|
|
int i; |
|
|
|
@ -202,7 +420,7 @@ public class ProbModel implements Model |
|
|
|
numStartStates = JDD.GetNumMinterms(start, allDDRowVars.n()); |
|
|
|
|
|
|
|
// work out number of transitions |
|
|
|
numTransitions = JDD.GetNumMinterms(trans01, allDDRowVars.n()*2); |
|
|
|
numTransitions = JDD.GetNumMinterms(trans01, getNumDDVarsInTrans()); |
|
|
|
|
|
|
|
// build odd |
|
|
|
odd = ODDUtils.BuildODD(reach, allDDRowVars); |
|
|
|
@ -248,7 +466,11 @@ public class ProbModel implements Model |
|
|
|
// JDD.PrintMatrix(trans01, allDDRowVars, allDDColVars, JDD.ZERO_ONE); |
|
|
|
} |
|
|
|
|
|
|
|
public void printTransInfo(PrismLog log) { printTransInfo(log, false); } |
|
|
|
public void printTransInfo(PrismLog log) |
|
|
|
{ |
|
|
|
printTransInfo(log, false); |
|
|
|
} |
|
|
|
|
|
|
|
public void printTransInfo(PrismLog log, boolean extra) |
|
|
|
{ |
|
|
|
int i, j, n; |
|
|
|
@ -258,11 +480,8 @@ public class ProbModel implements Model |
|
|
|
|
|
|
|
log.println(); |
|
|
|
|
|
|
|
log.print("Transition matrix: "); |
|
|
|
log.print(JDD.GetNumNodes(trans) + " nodes ("); |
|
|
|
log.print(JDD.GetNumTerminals(trans) + " terminal), "); |
|
|
|
log.print(JDD.GetNumMintermsString(trans, getNumDDVarsInTrans()) + " minterms, "); |
|
|
|
log.print("vars: " + getNumDDRowVars() + "r/" + getNumDDColVars() + "c\n"); |
|
|
|
log.print(getTransName() + ": " + JDD.GetInfoString(trans, getNumDDVarsInTrans())); |
|
|
|
log.print(", vars: " + getNumDDRowVars() + "r/" + getNumDDColVars() + "c\n"); |
|
|
|
if (extra) { |
|
|
|
log.print("DD vars (r/c):"); |
|
|
|
n = allDDRowVars.getNumVars(); |
|
|
|
@ -273,28 +492,33 @@ public class ProbModel implements Model |
|
|
|
log.print(" " + j + ":" + ddVarNames.get(j)); |
|
|
|
} |
|
|
|
log.println(); |
|
|
|
log.print("Transition matrix terminals: " + JDD.GetTerminalsAndNumbersString(trans, getNumDDVarsInTrans())+"\n"); |
|
|
|
log.print(getTransName() + " terminals: " + JDD.GetTerminalsAndNumbersString(trans, getNumDDVarsInTrans()) |
|
|
|
+ "\n"); |
|
|
|
log.print("Reach: " + JDD.GetNumNodes(reach) + " nodes\n"); |
|
|
|
log.print("ODD: " + ODDUtils.GetNumODDNodes() + " nodes\n"); |
|
|
|
} |
|
|
|
for (i = 0; i < numRewardStructs; i++) { |
|
|
|
if (stateRewards[i] != null && !stateRewards[i].equals(JDD.ZERO)) { |
|
|
|
log.print("State rewards ("+(i+1)+(("".equals(rewardStructNames[i]))?"":(":\""+rewardStructNames[i]+"\""))+"): "); |
|
|
|
log.print("State rewards (" + (i + 1) |
|
|
|
+ (("".equals(rewardStructNames[i])) ? "" : (":\"" + rewardStructNames[i] + "\"")) + "): "); |
|
|
|
log.print(JDD.GetNumNodes(stateRewards[i]) + " nodes ("); |
|
|
|
log.print(JDD.GetNumTerminals(stateRewards[i]) + " terminal), "); |
|
|
|
log.print(JDD.GetNumMintermsString(stateRewards[i], getNumDDRowVars()) + " minterms\n"); |
|
|
|
if (extra) { |
|
|
|
log.print("State rewards terminals ("+(i+1)+(("".equals(rewardStructNames[i]))?"":(":\""+rewardStructNames[i]+"\""))+"): "); |
|
|
|
log.print("State rewards terminals (" + (i + 1) |
|
|
|
+ (("".equals(rewardStructNames[i])) ? "" : (":\"" + rewardStructNames[i] + "\"")) + "): "); |
|
|
|
log.print(JDD.GetTerminalsAndNumbersString(stateRewards[i], getNumDDRowVars()) + "\n"); |
|
|
|
} |
|
|
|
} |
|
|
|
if (transRewards[i] != null && !transRewards[i].equals(JDD.ZERO)) { |
|
|
|
log.print("Transition rewards ("+(i+1)+(("".equals(rewardStructNames[i]))?"":(":\""+rewardStructNames[i]+"\""))+"): "); |
|
|
|
log.print("Transition rewards (" + (i + 1) |
|
|
|
+ (("".equals(rewardStructNames[i])) ? "" : (":\"" + rewardStructNames[i] + "\"")) + "): "); |
|
|
|
log.print(JDD.GetNumNodes(transRewards[i]) + " nodes ("); |
|
|
|
log.print(JDD.GetNumTerminals(transRewards[i]) + " terminal), "); |
|
|
|
log.print(JDD.GetNumMintermsString(transRewards[i], getNumDDVarsInTrans()) + " minterms\n"); |
|
|
|
if (extra) { |
|
|
|
log.print("Transition rewards terminals ("+(i+1)+(("".equals(rewardStructNames[i]))?"":(":\""+rewardStructNames[i]+"\""))+"): "); |
|
|
|
log.print("Transition rewards terminals (" + (i + 1) |
|
|
|
+ (("".equals(rewardStructNames[i])) ? "" : (":\"" + rewardStructNames[i] + "\"")) + "): "); |
|
|
|
log.print(JDD.GetTerminalsAndNumbersString(transRewards[i], getNumDDVarsInTrans()) + "\n"); |
|
|
|
} |
|
|
|
} |
|
|
|
@ -306,10 +530,11 @@ public class ProbModel implements Model |
|
|
|
public void exportToFile(int exportType, boolean explicit, File file) throws FileNotFoundException |
|
|
|
{ |
|
|
|
if (!explicit) { |
|
|
|
PrismMTBDD.ExportMatrix(trans, "P", allDDRowVars, allDDColVars, odd, exportType, (file != null)?file.getPath():null); |
|
|
|
} |
|
|
|
else { |
|
|
|
PrismSparse.ExportMatrix(trans, "P", allDDRowVars, allDDColVars, odd, exportType, (file != null)?file.getPath():null); |
|
|
|
PrismMTBDD.ExportMatrix(trans, getTransSymbol(), allDDRowVars, allDDColVars, odd, exportType, (file != null) ? file |
|
|
|
.getPath() : null); |
|
|
|
} else { |
|
|
|
PrismSparse.ExportMatrix(trans, getTransSymbol(), allDDRowVars, allDDColVars, odd, exportType, (file != null) ? file |
|
|
|
.getPath() : null); |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
@ -319,7 +544,8 @@ public class ProbModel implements Model |
|
|
|
|
|
|
|
public String exportStateRewardsToFile(int exportType, File file) throws FileNotFoundException, PrismException |
|
|
|
{ |
|
|
|
if (numRewardStructs == 0) throw new PrismException("There are no state rewards to export"); |
|
|
|
if (numRewardStructs == 0) |
|
|
|
throw new PrismException("There are no state rewards to export"); |
|
|
|
int i; |
|
|
|
String filename, allFilenames = ""; |
|
|
|
for (i = 0; i < numRewardStructs; i++) { |
|
|
|
@ -337,9 +563,11 @@ public class ProbModel implements Model |
|
|
|
|
|
|
|
// returns string containing files used if there were more than 1, null otherwise |
|
|
|
|
|
|
|
public String exportTransRewardsToFile(int exportType, boolean explicit, File file) throws FileNotFoundException, PrismException |
|
|
|
public String exportTransRewardsToFile(int exportType, boolean explicit, File file) throws FileNotFoundException, |
|
|
|
PrismException |
|
|
|
{ |
|
|
|
if (numRewardStructs == 0) throw new PrismException("There are no transition rewards to export"); |
|
|
|
if (numRewardStructs == 0) |
|
|
|
throw new PrismException("There are no transition rewards to export"); |
|
|
|
int i; |
|
|
|
String filename, allFilenames = ""; |
|
|
|
for (i = 0; i < numRewardStructs; i++) { |
|
|
|
@ -349,10 +577,11 @@ public class ProbModel implements Model |
|
|
|
allFilenames += ((i > 0) ? ", " : "") + filename; |
|
|
|
} |
|
|
|
if (!explicit) { |
|
|
|
PrismMTBDD.ExportMatrix(transRewards[i], "C"+i, allDDRowVars, allDDColVars, odd, exportType, filename); |
|
|
|
} |
|
|
|
else { |
|
|
|
PrismSparse.ExportMatrix(transRewards[i], "C"+i, allDDRowVars, allDDColVars, odd, exportType, filename); |
|
|
|
PrismMTBDD |
|
|
|
.ExportMatrix(transRewards[i], "C" + i, allDDRowVars, allDDColVars, odd, exportType, filename); |
|
|
|
} else { |
|
|
|
PrismSparse.ExportMatrix(transRewards[i], "C" + i, allDDRowVars, allDDColVars, odd, exportType, |
|
|
|
filename); |
|
|
|
} |
|
|
|
} |
|
|
|
return (allFilenames.length() > 0) ? allFilenames : null; |
|
|
|
@ -384,8 +613,7 @@ public class ProbModel implements Model |
|
|
|
for (i = 0; i < numVars - 1; i++) { |
|
|
|
if (i == l) { |
|
|
|
return (int) ((x / gtol[i + 1]) + varList.getLow(i)); |
|
|
|
} |
|
|
|
else { |
|
|
|
} else { |
|
|
|
x = x % gtol[i + 1]; |
|
|
|
} |
|
|
|
} |
|
|
|
|
Dave Parker
18 years ago