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.
143 lines
4.4 KiB
143 lines
4.4 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 <prism.h>
|
|
#include "PrismMTBDDGlob.h"
|
|
#include "jnipointer.h"
|
|
|
|
//------------------------------------------------------------------------------
|
|
|
|
JNIEXPORT jlong __jlongpointer JNICALL Java_mtbdd_PrismMTBDD_PM_1ProbTransient
|
|
(
|
|
JNIEnv *env,
|
|
jclass cls,
|
|
jlong __jlongpointer tr, // rate matrix
|
|
jlong __jlongpointer od, // odd
|
|
jlong __jlongpointer in, // initial distribution (note: this will be derefed afterwards)
|
|
jlong __jlongpointer rv, // row vars
|
|
jint num_rvars,
|
|
jlong __jlongpointer cv, // col vars
|
|
jint num_cvars,
|
|
jint time // time
|
|
)
|
|
{
|
|
// cast function parameters
|
|
DdNode *trans = jlong_to_DdNode(tr); // trans matrix
|
|
ODDNode *odd = jlong_to_ODDNode(od); // odd
|
|
DdNode *init = jlong_to_DdNode(in); // initial distribution
|
|
DdNode **rvars = jlong_to_DdNode_array(rv); // row vars
|
|
DdNode **cvars = jlong_to_DdNode_array(cv); // col vars
|
|
|
|
// mtbdds
|
|
DdNode *sol, *tmp;
|
|
// timing stuff
|
|
long start1, start2, start3, stop;
|
|
double time_taken, time_for_setup, time_for_iters;
|
|
// misc
|
|
int iters;
|
|
bool done;
|
|
|
|
// start clocks
|
|
start1 = start2 = util_cpu_time();
|
|
|
|
// set up vectors
|
|
Cudd_Ref(init);
|
|
sol = init;
|
|
sol = DD_PermuteVariables(ddman, sol, rvars, cvars, num_rvars);
|
|
|
|
// 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");
|
|
|
|
// note that we ignore max_iters as we know how any iterations _should_ be performed
|
|
for (iters = 0; iters < time && !done; iters++) {
|
|
|
|
//matrix-vector multiply
|
|
Cudd_Ref(sol);
|
|
tmp = DD_PermuteVariables(ddman, sol, cvars, rvars, num_rvars);
|
|
Cudd_Ref(trans);
|
|
tmp = DD_MatrixMultiply(ddman, tmp, trans, rvars, num_rvars, MM_BOULDER);
|
|
|
|
// check for steady state convergence
|
|
if (do_ss_detect) 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 (of %d): ", iters, time);
|
|
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;
|
|
}
|
|
|
|
// convert to row vector
|
|
sol = DD_PermuteVariables(ddman, sol, cvars, rvars, num_rvars);
|
|
|
|
// stop clocks
|
|
stop = util_cpu_time();
|
|
time_for_iters = (double)(stop - start2)/1000;
|
|
time_taken = (double)(stop - start1)/1000;
|
|
|
|
// print iterations/timing info
|
|
if (done) PM_PrintToMainLog(env, "\nSteady state detected at iteration %d\n", iters);
|
|
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);
|
|
|
|
// derefs
|
|
// nb: we deref init, even though it is passed in as a param
|
|
Cudd_RecursiveDeref(ddman, init);
|
|
|
|
return ptr_to_jlong(sol);
|
|
}
|
|
|
|
//------------------------------------------------------------------------------
|