Uses of Class
dk.brics.bisimulationGame.equiv.Successor

Packages that use Successor
dk.brics.bisimulationGame.equiv   
dk.brics.bisimulationGame.model   
 

Uses of Successor in dk.brics.bisimulationGame.equiv
 

Fields in dk.brics.bisimulationGame.equiv with type parameters of type Successor
private  java.util.HashMap<att.grappa.Node,java.util.Vector<Successor>> StateSpace.leftSuccessorMap
           
private  java.util.HashMap<att.grappa.Node,java.util.Vector<Successor>> StateSpace.rightSuccessorMap
           
 

Methods in dk.brics.bisimulationGame.equiv with parameters of type Successor
private  boolean Successor.equals(Successor other)
           
 

Constructor parameters in dk.brics.bisimulationGame.equiv with type arguments of type Successor
StateSpace(att.grappa.Node initialNodeLeft, att.grappa.Node initialNodeRight, java.util.HashMap<att.grappa.Node,java.util.Vector<Successor>> leftSuccessorMap, java.util.HashMap<att.grappa.Node,java.util.Vector<Successor>> rightSuccessorMap)
          Constructs a state space based on a successor map, but does not partition it.
StateSpace(att.grappa.Node initialNodeLeft, att.grappa.Node initialNodeRight, java.util.HashMap<att.grappa.Node,java.util.Vector<Successor>> leftSuccessorMap, java.util.HashMap<att.grappa.Node,java.util.Vector<Successor>> rightSuccessorMap)
          Constructs a state space based on a successor map, but does not partition it.
 

Uses of Successor in dk.brics.bisimulationGame.model
 

Fields in dk.brics.bisimulationGame.model with type parameters of type Successor
private  java.util.HashMap<att.grappa.Node,java.util.Vector<Successor>> GrappaModel.successorMap
           
 

Methods in dk.brics.bisimulationGame.model that return types with arguments of type Successor
 java.util.Vector<Successor> GrappaModel.getStrongChoices()
          Used by an attacker to get all choices from the current node that are not weak.
private  java.util.HashMap<att.grappa.Node,java.util.Vector<Successor>> GrappaModel.getStrongSuccessorMap()
          Makes a map from each node to its direct successors.
 java.util.HashMap<att.grappa.Node,java.util.Vector<Successor>> GrappaModel.getSuccessorMap()
           
private  java.util.HashMap<att.grappa.Node,java.util.Vector<Successor>> GrappaModel.getWeakSuccessorMap()
          Makes a map from each node to its weak successors.
 

Method parameters in dk.brics.bisimulationGame.model with type arguments of type Successor
private  java.util.Vector<java.lang.String> GrappaModel.getEdgeLabels(java.util.Vector<Successor> toMap, att.grappa.Node to)
          Get the labels of in-edges of node 'to'.