Browse Source
Sparse version of MDP instantaneous reward operator (and commented-out code for printing all values - sparse/mtbdd).
Sparse version of MDP instantaneous reward operator (and commented-out code for printing all values - sparse/mtbdd).
git-svn-id: https://www.prismmodelchecker.org/svn/prism/prism/trunk@542 bbc10eb1-c90d-0410-af57-cb519fbb1720master
Dave Parker
19 years ago
7 changed files with 247 additions and 7 deletions
-
4prism/include/PrismMTBDD.h
-
8prism/include/PrismSparse.h
-
11prism/src/mtbdd/PM_NondetInstReward.cc
-
6prism/src/mtbdd/PrismMTBDD.java
-
6prism/src/prism/NondetModelChecker.java
-
210prism/src/sparse/PS_NondetInstReward.cc
-
9prism/src/sparse/PrismSparse.java
@ -0,0 +1,210 @@ |
|||
//==============================================================================
|
|||
//
|
|||
// Copyright (c) 2002-
|
|||
// Authors:
|
|||
// * Dave Parker <dxp@cs.bham.uc.uk> (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 "PrismSparse.h"
|
|||
#include <math.h>
|
|||
#include <util.h>
|
|||
#include <cudd.h>
|
|||
#include <dd.h>
|
|||
#include <odd.h>
|
|||
#include <dv.h>
|
|||
#include "sparse.h"
|
|||
#include "PrismSparseGlob.h"
|
|||
#include "jnipointer.h"
|
|||
|
|||
//------------------------------------------------------------------------------
|
|||
|
|||
JNIEXPORT jlong __pointer JNICALL Java_sparse_PrismSparse_PS_1NondetInstReward |
|||
( |
|||
JNIEnv *env, |
|||
jclass cls, |
|||
jlong __pointer t, // trans matrix
|
|||
jlong __pointer sr, // state rewards
|
|||
jlong __pointer od, // odd
|
|||
jlong __pointer rv, // row vars
|
|||
jint num_rvars, |
|||
jlong __pointer cv, // col vars
|
|||
jint num_cvars, |
|||
jlong __pointer ndv, // nondet vars
|
|||
jint num_ndvars, |
|||
jint bound, // time bound
|
|||
jboolean min, // min or max probabilities (true = min, false = max)
|
|||
jlong __pointer in |
|||
) |
|||
{ |
|||
// cast function parameters
|
|||
DdNode *trans = jlong_to_DdNode(t); // trans matrix
|
|||
DdNode *state_rewards = jlong_to_DdNode(sr); // state rewards
|
|||
ODDNode *odd = jlong_to_ODDNode(od); // reachable states
|
|||
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 *init = jlong_to_DdNode(in); |
|||
|
|||
// mtbdds
|
|||
DdNode *tmp; |
|||
// model stats
|
|||
int n, nc; |
|||
long nnz; |
|||
// sparse matrix
|
|||
NDSparseMatrix *ndsm; |
|||
// vectors
|
|||
double *sr_vec, *soln, *soln2, *tmpsoln; |
|||
// timing stuff
|
|||
long start1, start2, start3, stop; |
|||
double time_taken, time_for_setup, time_for_iters; |
|||
// misc
|
|||
int i, j, k, l1, h1, l2, h2, iters; |
|||
double d1, d2, kb, kbt; |
|||
bool first; |
|||
|
|||
// start clocks
|
|||
start1 = start2 = util_cpu_time(); |
|||
|
|||
// get number of states
|
|||
n = odd->eoff + odd->toff; |
|||
|
|||
// build sparse matrix (probs)
|
|||
PS_PrintToMainLog(env, "\nBuilding sparse matrix (transitions)... "); |
|||
ndsm = build_nd_sparse_matrix(ddman, trans, rvars, cvars, num_rvars, ndvars, num_ndvars, odd); |
|||
// get number of transitions/choices
|
|||
nnz = ndsm->nnz; |
|||
nc = ndsm->nc; |
|||
// print out info
|
|||
PS_PrintToMainLog(env, "[n=%d, nc=%d, nnz=%d, k=%d] ", n, nc, nnz, ndsm->k); |
|||
kb = (nnz*12.0+nc*4.0+n*4.0)/1024.0; |
|||
kbt = kb; |
|||
PS_PrintToMainLog(env, "[%.1f KB]\n", kb); |
|||
|
|||
// get vector for state rewards
|
|||
PS_PrintToMainLog(env, "Creating vector for state rewards... "); |
|||
sr_vec = mtbdd_to_double_vector(ddman, state_rewards, rvars, num_rvars, odd); |
|||
kb = n*8.0/1024.0; |
|||
kbt += kb; |
|||
PS_PrintToMainLog(env, "[%.1f KB]\n", kb); |
|||
|
|||
// create solution/iteration vectors
|
|||
PS_PrintToMainLog(env, "Allocating iteration vectors... "); |
|||
soln = new double[n]; |
|||
soln2 = new double[n]; |
|||
kb = n*8.0/1024.0; |
|||
kbt += 2*kb; |
|||
PS_PrintToMainLog(env, "[2 x %.1f KB]\n", kb); |
|||
|
|||
// print total memory usage
|
|||
PS_PrintToMainLog(env, "TOTAL: [%.1f KB]\n", kbt); |
|||
|
|||
// initial solution is the state rewards
|
|||
for (i = 0; i < n; i++) { |
|||
soln[i] = sr_vec[i]; |
|||
} |
|||
|
|||
// get setup time
|
|||
stop = util_cpu_time(); |
|||
time_for_setup = (double)(stop - start2)/1000; |
|||
start2 = stop; |
|||
|
|||
// start iterations
|
|||
PS_PrintToMainLog(env, "\nStarting iterations...\n"); |
|||
|
|||
// note that we ignore max_iters as we know how any iterations _should_ be performed
|
|||
for (iters = 0; iters < bound; iters++) { |
|||
|
|||
// PS_PrintToMainLog(env, "iter %d\n", iters);
|
|||
// start3 = util_cpu_time();
|
|||
|
|||
// store local copies of stuff
|
|||
double *non_zeros = ndsm->non_zeros; |
|||
unsigned char *row_counts = ndsm->row_counts; |
|||
int *row_starts = (int *)ndsm->row_counts; |
|||
unsigned char *choice_counts = ndsm->choice_counts; |
|||
int *choice_starts = (int *)ndsm->choice_counts; |
|||
bool use_counts = ndsm->use_counts; |
|||
unsigned int *cols = ndsm->cols; |
|||
|
|||
// do matrix multiplication and min/max
|
|||
h1 = h2 = 0; |
|||
// loop through states
|
|||
for (i = 0; i < n; i++) { |
|||
d1 = 0.0; |
|||
first = true; |
|||
// get pointers to nondeterministic choices for state i
|
|||
if (!use_counts) { l1 = row_starts[i]; h1 = row_starts[i+1]; } |
|||
else { l1 = h1; h1 += row_counts[i]; } |
|||
// loop through those choices
|
|||
for (j = l1; j < h1; j++) { |
|||
// compute the reward value for state i for this iteration
|
|||
// start with state reward for this state
|
|||
d2 = 0.0; |
|||
// get pointers to transitions
|
|||
if (!use_counts) { l2 = choice_starts[j]; h2 = choice_starts[j+1]; } |
|||
else { l2 = h2; h2 += choice_counts[j]; } |
|||
// loop through transitions
|
|||
for (k = l2; k < h2; k++) { |
|||
// add prob * corresponding reward from previous iteration
|
|||
d2 += non_zeros[k] * soln[cols[k]]; |
|||
} |
|||
// see if this value is the min/max so far
|
|||
if (min) { |
|||
if (first | d2 < d1) d1 = d2; |
|||
} else { |
|||
if (first | d2 > d1) d1 = d2; |
|||
} |
|||
first = false; |
|||
} |
|||
// set vector element
|
|||
// (if there were no choices from this state, reward is zero)
|
|||
soln2[i] = (h1 > l1) ? d1 : 0; |
|||
} |
|||
|
|||
// prepare for next iteration
|
|||
tmpsoln = soln; |
|||
soln = soln2; |
|||
soln2 = tmpsoln; |
|||
|
|||
// PS_PrintToMainLog(env, "%i: %f\n", iters, get_first_from_bdd(ddman, soln, init, rvars, num_rvars, odd));
|
|||
|
|||
// PS_PrintToMainLog(env, "%.2f %.2f sec\n", ((double)(util_cpu_time() - start3)/1000), ((double)(util_cpu_time() - start2)/1000)/iters);
|
|||
} |
|||
|
|||
// stop clocks
|
|||
stop = util_cpu_time(); |
|||
time_for_iters = (double)(stop - start2)/1000; |
|||
time_taken = (double)(stop - start1)/1000; |
|||
|
|||
// print iterations/timing info
|
|||
PS_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
|
|||
free_nd_sparse_matrix(ndsm); |
|||
delete sr_vec; |
|||
delete soln2; |
|||
|
|||
return ptr_to_jlong(soln); |
|||
} |
|||
|
|||
//------------------------------------------------------------------------------
|
|||
Write
Preview
Loading…
Cancel
Save
Reference in new issue