You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
212 lines
6.8 KiB
212 lines
6.8 KiB
//==============================================================================
|
|
//
|
|
// Copyright (c) 2002-
|
|
// Authors:
|
|
// * Dave Parker <david.parker@comlab.ox.ac.uk> (University of Oxford, formerly University of Birmingham)
|
|
//
|
|
//------------------------------------------------------------------------------
|
|
//
|
|
// This file is part of PRISM.
|
|
//
|
|
// PRISM is free software; you can redistribute it and/or modify
|
|
// it under the terms of the GNU General Public License as published by
|
|
// the Free Software Foundation; either version 2 of the License, or
|
|
// (at your option) any later version.
|
|
//
|
|
// PRISM is distributed in the hope that it will be useful,
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
// GNU General Public License for more details.
|
|
//
|
|
// You should have received a copy of the GNU General Public License
|
|
// along with PRISM; if not, write to the Free Software Foundation,
|
|
// Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
//
|
|
//==============================================================================
|
|
|
|
// includes
|
|
#include "PrismMTBDD.h"
|
|
#include <math.h>
|
|
#include <util.h>
|
|
#include <cudd.h>
|
|
#include <dd.h>
|
|
#include <odd.h>
|
|
#include "PrismMTBDDGlob.h"
|
|
#include "jnipointer.h"
|
|
#include "prism.h"
|
|
|
|
//------------------------------------------------------------------------------
|
|
|
|
JNIEXPORT jlong __jlongpointer JNICALL Java_mtbdd_PrismMTBDD_PM_1NondetReachReward
|
|
(
|
|
JNIEnv *env,
|
|
jclass cls,
|
|
jlong __jlongpointer t, // trans matrix
|
|
jlong __jlongpointer sr, // state rewards
|
|
jlong __jlongpointer trr, // state rewards
|
|
jlong __jlongpointer od, // odd
|
|
jlong __jlongpointer ndm, // nondeterminism mask
|
|
jlong __jlongpointer rv, // row vars
|
|
jint num_rvars,
|
|
jlong __jlongpointer cv, // col vars
|
|
jint num_cvars,
|
|
jlong __jlongpointer ndv, // nondet vars
|
|
jint num_ndvars,
|
|
jlong __jlongpointer g, // 'goal' states
|
|
jlong __jlongpointer in, // 'inf' states
|
|
jlong __jlongpointer m, // 'maybe' states
|
|
jboolean min // min or max probabilities (true = min, false = max)
|
|
)
|
|
{
|
|
// cast function parameters
|
|
DdNode *trans = jlong_to_DdNode(t); // trans matrix
|
|
DdNode *state_rewards = jlong_to_DdNode(sr); // state rewards
|
|
DdNode *trans_rewards = jlong_to_DdNode(trr); // transition rewards
|
|
ODDNode *odd = jlong_to_ODDNode(od); // odd
|
|
DdNode *mask = jlong_to_DdNode(ndm); // nondeterminism mask
|
|
DdNode **rvars = jlong_to_DdNode_array(rv); // row vars
|
|
DdNode **cvars = jlong_to_DdNode_array(cv); // col vars
|
|
DdNode **ndvars = jlong_to_DdNode_array(ndv); // nondet vars
|
|
DdNode *goal = jlong_to_DdNode(g); // 'goal' states
|
|
DdNode *inf = jlong_to_DdNode(in); // 'inf' states
|
|
DdNode *maybe = jlong_to_DdNode(m); // 'maybe' states
|
|
|
|
// mtbdds
|
|
DdNode *reach, *a, *all_rewards, *new_mask, *sol, *tmp;
|
|
// timing stuff
|
|
long start1, start2, start3, stop;
|
|
double time_taken, time_for_setup, time_for_iters;
|
|
// misc
|
|
bool done;
|
|
int iters, i;
|
|
|
|
// start clocks
|
|
start1 = start2 = util_cpu_time();
|
|
|
|
// get reachable states
|
|
reach = odd->dd;
|
|
|
|
PM_PrintToMainLog(env, "\nBuilding iteration matrix MTBDD... ");
|
|
|
|
// filter out rows (goal states and infinity states) from matrix
|
|
Cudd_Ref(trans);
|
|
Cudd_Ref(maybe);
|
|
a = DD_Apply(ddman, APPLY_TIMES, trans, maybe);
|
|
|
|
// also remove goal and infinity states from state rewards vector
|
|
Cudd_Ref(state_rewards);
|
|
Cudd_Ref(maybe);
|
|
state_rewards = DD_Apply(ddman, APPLY_TIMES, state_rewards, maybe);
|
|
|
|
// multiply transition rewards by transition probs and sum rows
|
|
// (note also filters out unwanted states at the same time)
|
|
Cudd_Ref(trans_rewards);
|
|
Cudd_Ref(a);
|
|
trans_rewards = DD_Apply(ddman, APPLY_TIMES, trans_rewards, a);
|
|
trans_rewards = DD_SumAbstract(ddman, trans_rewards, cvars, num_cvars);
|
|
|
|
// combine state and transition rewards
|
|
all_rewards = DD_Apply(ddman, APPLY_PLUS, state_rewards, trans_rewards);
|
|
|
|
// need to change mask because rewards are not necessarily in the range 0..1
|
|
Cudd_Ref(mask);
|
|
new_mask = DD_ITE(ddman, mask, DD_PlusInfinity(ddman), DD_Constant(ddman, 0));
|
|
|
|
// initial solution is infinity in 'inf' states, zero elsewhere
|
|
// note: ok to do this because cudd matrix-multiply (and other ops)
|
|
// treat 0 * inf as 0, unlike in IEEE 754 rules
|
|
Cudd_Ref(inf);
|
|
sol = DD_ITE(ddman, inf, DD_PlusInfinity(ddman), DD_Constant(ddman, 0));
|
|
|
|
// print memory usage
|
|
i = DD_GetNumNodes(ddman, a);
|
|
PM_PrintToMainLog(env, "[nodes=%d] [%.1f Kb]\n", i, i*20.0/1024.0);
|
|
|
|
// get setup time
|
|
stop = util_cpu_time();
|
|
time_for_setup = (double)(stop - start2)/1000;
|
|
start2 = stop;
|
|
start3 = stop;
|
|
|
|
// start iterations
|
|
iters = 0;
|
|
done = false;
|
|
PM_PrintToMainLog(env, "\nStarting iterations...\n");
|
|
|
|
while (!done && iters < max_iters) {
|
|
|
|
iters++;
|
|
|
|
// matrix-vector multiply
|
|
Cudd_Ref(sol);
|
|
tmp = DD_PermuteVariables(ddman, sol, rvars, cvars, num_rvars);
|
|
Cudd_Ref(a);
|
|
tmp = DD_MatrixMultiply(ddman, a, tmp, cvars, num_cvars, MM_BOULDER);
|
|
|
|
// add rewards
|
|
Cudd_Ref(all_rewards);
|
|
tmp = DD_Apply(ddman, APPLY_PLUS, tmp, all_rewards);
|
|
|
|
// do min/max
|
|
if (min) {
|
|
// mask stuff
|
|
Cudd_Ref(new_mask);
|
|
tmp = DD_Apply(ddman, APPLY_MAX, tmp, new_mask);
|
|
// abstract
|
|
tmp = DD_MinAbstract(ddman, tmp, ndvars, num_ndvars);
|
|
}
|
|
else {
|
|
// abstract
|
|
tmp = DD_MaxAbstract(ddman, tmp, ndvars, num_ndvars);
|
|
}
|
|
|
|
// put infinities (for 'inf' states) back into into solution vector
|
|
Cudd_Ref(inf);
|
|
tmp = DD_ITE(ddman, inf, DD_PlusInfinity(ddman), tmp);
|
|
|
|
// check convergence
|
|
switch (term_crit) {
|
|
case TERM_CRIT_ABSOLUTE:
|
|
if (DD_EqualSupNorm(ddman, tmp, sol, term_crit_param)) {
|
|
done = true;
|
|
}
|
|
break;
|
|
case TERM_CRIT_RELATIVE:
|
|
if (DD_EqualSupNormRel(ddman, tmp, sol, term_crit_param)) {
|
|
done = true;
|
|
}
|
|
break;
|
|
}
|
|
|
|
// print occasional status update
|
|
if ((util_cpu_time() - start3) > UPDATE_DELAY) {
|
|
PM_PrintToMainLog(env, "Iteration %d: ", iters);
|
|
PM_PrintToMainLog(env, "%.2f sec so far\n", ((double)(util_cpu_time() - start2)/1000));
|
|
start3 = util_cpu_time();
|
|
}
|
|
|
|
// prepare for next iteration
|
|
Cudd_RecursiveDeref(ddman, sol);
|
|
sol = tmp;
|
|
}
|
|
|
|
// stop clocks
|
|
stop = util_cpu_time();
|
|
time_for_iters = (double)(stop - start2)/1000;
|
|
time_taken = (double)(stop - start1)/1000;
|
|
|
|
// print iterations/timing info
|
|
PM_PrintToMainLog(env, "\nIterative method: %d iterations in %.2f seconds (average %.6f, setup %.2f)\n", iters, time_taken, time_for_iters/iters, time_for_setup);
|
|
|
|
// free memory
|
|
Cudd_RecursiveDeref(ddman, a);
|
|
Cudd_RecursiveDeref(ddman, all_rewards);
|
|
Cudd_RecursiveDeref(ddman, new_mask);
|
|
|
|
// if the iterative method didn't terminate, this is an error
|
|
if (!done) { Cudd_RecursiveDeref(ddman, sol); PM_SetErrorMessage("Iterative method did not converge within %d iterations.\nConsider using a different numerical method or increasing the maximum number of iterations", iters); return 0; }
|
|
|
|
return ptr_to_jlong(sol);
|
|
}
|
|
|
|
//------------------------------------------------------------------------------
|