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.
 
 
 
 
 
 

232 lines
5.0 KiB

//==============================================================================
//
// Copyright (c) 2002-
// Authors:
// * Dave Parker <david.parker@comlab.ox.ac.uk> (University of Oxford)
//
//------------------------------------------------------------------------------
//
// 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
//
//==============================================================================
package explicit;
import java.util.*;
import java.util.Map.Entry;
import explicit.rewards.MCRewards;
import parser.State;
import parser.Values;
import prism.ModelType;
import prism.PrismException;
/**
* Explicit-state representation of a DTMC, constructed (implicitly)
* from an MDP and a memoryless adversary, specified as an array of integer indices.
* This class is read-only: most of data is pointers to other model info.
*/
public class DTMCFromMDPMemorylessAdversary extends DTMCExplicit
{
// Parent MDP
protected MDP mdp;
// Also store num states for easy access
protected int numStates;
// Adversary
protected int adv[];
/**
* Constructor: create from MDP and memoryless adversary.
*/
public DTMCFromMDPMemorylessAdversary(MDP mdp, int adv[])
{
this.mdp = mdp;
this.numStates = mdp.getNumStates();
this.adv = adv;
}
@Override
public void buildFromPrismExplicit(String filename) throws PrismException
{
throw new PrismException("Not supported");
}
// Accessors (for Model)
public ModelType getModelType()
{
return ModelType.DTMC;
}
public int getNumStates()
{
return mdp.getNumStates();
}
public int getNumInitialStates()
{
return mdp.getNumInitialStates();
}
public Iterable<Integer> getInitialStates()
{
return mdp.getInitialStates();
}
public int getFirstInitialState()
{
return mdp.getFirstInitialState();
}
public boolean isInitialState(int i)
{
return mdp.isInitialState(i);
}
public boolean isFixedDeadlockState(int i)
{
return mdp.isFixedDeadlockState(i);
}
public List<State> getStatesList()
{
return mdp.getStatesList();
}
public Values getConstantValues()
{
return mdp.getConstantValues();
}
public int getNumTransitions()
{
throw new RuntimeException("Not implemented");
}
public boolean isSuccessor(int s1, int s2)
{
throw new RuntimeException("Not implemented yet");
}
public boolean allSuccessorsInSet(int s, BitSet set)
{
throw new RuntimeException("Not implemented yet");
}
public boolean someSuccessorsInSet(int s, BitSet set)
{
throw new RuntimeException("Not implemented yet");
}
public int getNumChoices(int s)
{
// Always 1 for a DTMC
return 1;
}
public void checkForDeadlocks() throws PrismException
{
// No deadlocks by definition
}
public void checkForDeadlocks(BitSet except) throws PrismException
{
// No deadlocks by definition
}
public BitSet findDeadlocks(boolean fix) throws PrismException
{
// No deadlocks by definition
return new BitSet();
}
@Override
public String infoString()
{
return mdp.infoString() + " + " + "???"; // TODO
}
@Override
public String infoStringTable()
{
return mdp.infoString() + " + " + "???\n"; // TODO
}
// Accessors (for DTMC)
public double getNumTransitions(int s)
{
// TODO
throw new RuntimeException("Not implemented yet");
}
public Iterator<Entry<Integer,Double>> getTransitionsIterator(int s)
{
// TODO
throw new RuntimeException("Not implemented yet");
}
public void prob0step(BitSet subset, BitSet u, BitSet result)
{
// TODO
throw new Error("Not yet supported");
}
public void prob1step(BitSet subset, BitSet u, BitSet v, BitSet result)
{
// TODO
throw new Error("Not yet supported");
}
@Override
public double mvMultSingle(int s, double vect[])
{
return mdp.mvMultSingle(s, adv[s], vect);
}
@Override
public double mvMultJacSingle(int s, double vect[])
{
return mdp.mvMultJacSingle(s, adv[s], vect);
}
@Override
public double mvMultRewSingle(int s, double vect[], MCRewards mcRewards)
{
throw new RuntimeException("Not implemented yet");
//return mdp.mvMultRewSingle(s, adv[s], vect);
}
@Override
public void vmMult(double vect[], double result[])
{
throw new RuntimeException("Not implemented yet"); // TODO
}
@Override
public String toString()
{
throw new RuntimeException("Not implemented yet");
}
@Override
public boolean equals(Object o)
{
throw new RuntimeException("Not implemented yet");
}
}