|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public interface ProbSystem
ProbSystem
This interface serve as a basis for teh probabilistic systems used by the engine. Currently, only systems that use hash tables and MTBDDs have been created. But any other alternate implantation would need to implement this interface.Copyright(c) 2005 Université Laval, LSFM research group.
Method Summary | |
---|---|
void |
addLabelToStates(java.util.HashMap map)
Apply all the label associations contained in the map table to the states. |
void |
addLabelToStates(java.lang.String ap,
IntervalList l)
Apply a single atomic proposition to a list of states. |
void |
addTransition(Transition t)
Add a new transition to the system |
void |
addTransition(Transition t,
boolean verify)
Add a new transition to the system, but the system integrity verification can be skipped to accelerate loading. |
java.util.HashMap |
computeProbabilities(IntervalList list,
java.lang.String act,
Variable v,
Parser p)
Returns all the intervals and their associated repartition functions which can be reached from the IntervalList list using the action a. |
java.util.ArrayList |
getActions()
Returns a list containing all the actions associated with the transitions |
java.util.TreeSet |
getAP()
Gets all the atomic propositions included in the system. |
java.util.ArrayList |
getEnd()
Returns the Y set (the ending intervals of the transitions) |
java.util.ArrayList |
getExp()
Returns all the expressions of the system |
double |
getInitialState()
Fetch the initial state. |
Mtbdd |
getM()
Fetch the integer identifying the CUDD manager associated with this system. |
int |
getNbAction()
Fetch the number of actions. |
java.util.ArrayList |
getStart()
Returns the X set (the starting intervals of the transitions) |
IntervalList |
getStates()
Gets all the possible states of the system. |
IntervalList |
getStatesForLabel(java.lang.String ap)
Returns the list of states associated to an atomic proposition |
int |
getTrans()
Get a set containing all of the system's transitions. |
Transition[] |
getTransitions()
Returns a list containing all the transitions of the system. |
java.util.Vector |
getTransitionsVector()
Returns a vactor containing all the transitions of the system. |
void |
removeLabelFromStates(java.lang.String ap,
IntervalList l)
Dissociates a list of intervals from an atomic proposition |
void |
removeTransition(Transition t)
Remove the specified transition from the system. |
void |
setInitialState(double newInitialState)
Modifies the initial state of the system |
void |
setStates(IntervalList newStateSpace)
Sets all the possible states of the system. |
java.lang.String |
toString()
Returns a string representing the probabilistic system. |
Method Detail |
---|
Mtbdd getM()
int getTrans()
int getNbAction()
double getInitialState()
void setInitialState(double newInitialState) throws java.lang.Exception
newInitialState
- the new initial state
java.lang.Exception
IntervalList getStates()
void setStates(IntervalList newStateSpace) throws java.lang.Exception
java.lang.Exception
- should the new state space be invalidjava.util.TreeSet getAP()
java.util.ArrayList getExp()
java.util.ArrayList getStart()
java.util.ArrayList getEnd()
void addLabelToStates(java.util.HashMap map) throws ProbSystemException
map
- an association table (states --> label)
ProbSystemException
- should an invalid association existvoid addLabelToStates(java.lang.String ap, IntervalList l) throws ProbSystemException
ap
- a label representing the atomic propositionl
- a list of states to attach the proposition
ProbSystemException
- should the list be invalidvoid removeLabelFromStates(java.lang.String ap, IntervalList l)
ap
- the association from which to remove the associationl
- the list of intervals to dissociateIntervalList getStatesForLabel(java.lang.String ap)
ap
- the atomic proposition to query
java.util.ArrayList getActions()
void addTransition(Transition t) throws ProbSystemException
t
- a valid transition to be added
ProbSystemException
- should the transition be invalidvoid addTransition(Transition t, boolean verify) throws ProbSystemException
t
- a valid transition to be addedverify
- if the system's integrity should be verified
ProbSystemException
- should the transition be invalidvoid removeTransition(Transition t)
t
- the transition to remove from the system.Transition[] getTransitions()
java.util.Vector getTransitionsVector()
java.lang.String toString()
toString
in class java.lang.Object
java.util.HashMap computeProbabilities(IntervalList list, java.lang.String act, Variable v, Parser p)
list
- the list of source intervals.act
- the action to apply.v
- the variable which must be computed.p
- a logical parser to analyse the expressions.
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |