org.ginsim.service.tool.avatar.domain

Interface FinalPaths

All Known Implementing Classes:

ApproximateFinalPaths, ExhaustiveFinalPaths

public interface FinalPaths

Interface for the storage transitions within and going-out of a state-set
Transitions can be represented in multiple ways (e.g. sparse structures, arrays, etc.)
Classes implementing this interface should be defined accordingly

Version:

1.0

Author:

Rui Henriques

Method Summary

Modifier and Type	Method and Description
void	addOutputPaths(Collection<String> states, Collection<String> exits, double prob) Creates transitions with uniform probability from a given cycle to its exits
void	addOutputPaths(Collection<String> states, Collection<String> exits, double[][] probs) Inserts transitions from a given cycle to its exits
Map<String,Double>	getPaths(String key) Returns the transitions to reachable exit states from a given state in the cycle

Method Detail

addOutputPaths

void addOutputPaths(Collection<String> states,
                    Collection<String> exits,
                    double prob)

Creates transitions with uniform probability from a given cycle to its exits

Parameters:

states - the states within the cycle

exits - the states accessible from the states within the cycle

prob - the uniform probability of the transitions between the all the cycle states and exit states

addOutputPaths

void addOutputPaths(Collection<String> states,
                    Collection<String> exits,
                    double[][] probs)
             throws AvatarLogicalModelException

Inserts transitions from a given cycle to its exits

Parameters:

states - the states within the cycle

exits - the states accessible from the states within the cycle

probs - a matrix specifying the probabilities of the transitions from the all the states of the cycle towards all the exit states

Throws:

AvatarLogicalModelException

getPaths

Map<String,Double> getPaths(String key)

Returns the transitions to reachable exit states from a given state in the cycle

Parameters:

key - the state in the cycle whose exits are to be computed

Returns:

the transitions to reachable exit states from a given state (the transitions maintain the keys of the exit states and the associated probability to reach them)