Package org.tweetyproject.logics.petri.syntax.reachability_graph

Class MarkovWalk

java.lang.Object
org.tweetyproject.logics.petri.syntax.reachability_graph.MarkovWalk
public class MarkovWalk extends Object
A class to perform a stochastic walk on a reachability graph based on a probability function on that graph
Author:
Benedikt Knopp

  • Constructor Details

    • MarkovWalk

      public MarkovWalk(ReachabilityGraph graph)
      Create a new instance
      Parameters:
      graph - the graph to walk

  • Method Details

    • initializeWalk

      public void initializeWalk()
      Initialize the walk by setting up an initial state that assigns equal probabilities to each of the graph's initial markings

    • performWalk

      public void performWalk()
      Walk the network until a stationary distribution is figured out This neglects control vectors

    • performShortCircuitWalk

      public void performShortCircuitWalk()
      Walk the network until a stationary distribution is figured out This also yields control vectors

    • getCurrentState

      public Matrix getCurrentState()
      Returns:
      the currentState

    • getMeanState

      public Matrix getMeanState()
      Returns:
      the mean state

    • getControlVector

      public Matrix getControlVector()
      Returns:
      the controlVector

    • getNormalizedControlVector

      public Matrix getNormalizedControlVector()
      Returns:
      the normalized control vector