|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use Successor | |
---|---|
dk.brics.bisim.equiv | |
dk.brics.bisim.model |
Uses of Successor in dk.brics.bisim.equiv |
---|
Classes in dk.brics.bisim.equiv that implement Successor | |
---|---|
class |
StrongSuccessor
The successor of a node. |
class |
WeakSuccessor
A weak successor. |
Fields in dk.brics.bisim.equiv with type parameters of type Successor | |
---|---|
private java.util.HashMap<att.grappa.Node,java.util.ArrayList<Successor>> |
StateSpace.leftSuccessorMap
|
private java.util.HashMap<att.grappa.Node,java.util.ArrayList<Successor>> |
StateSpace.rightSuccessorMap
|
Constructor parameters in dk.brics.bisim.equiv with type arguments of type Successor | |
---|---|
StateSpace(att.grappa.Node initialNodeLeft,
att.grappa.Node initialNodeRight,
java.util.HashMap<att.grappa.Node,java.util.ArrayList<Successor>> leftSuccessorMap,
java.util.HashMap<att.grappa.Node,java.util.ArrayList<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.ArrayList<Successor>> leftSuccessorMap,
java.util.HashMap<att.grappa.Node,java.util.ArrayList<Successor>> rightSuccessorMap)
Constructs a state space based on a successor map, but does not partition it. |
Uses of Successor in dk.brics.bisim.model |
---|
Fields in dk.brics.bisim.model with type parameters of type Successor | |
---|---|
private java.util.HashMap<att.grappa.Node,java.util.ArrayList<Successor>> |
LTSModel.successorMap
|
Methods in dk.brics.bisim.model that return types with arguments of type Successor | |
---|---|
private java.util.ArrayList<Successor> |
LTSModel.filterSuccessors(java.util.ArrayList<Successor> toMap,
att.grappa.Node to)
Get the labels of in-edges of node 'to'. |
java.util.ArrayList<Successor> |
LTSModel.getCurrentSuccessors()
|
java.util.ArrayList<Successor> |
LTSModel.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.ArrayList<Successor>> |
LTSModel.getStrongSuccessorMap()
Makes a map from each node to its direct successors. |
java.util.HashMap<att.grappa.Node,java.util.ArrayList<Successor>> |
LTSModel.getSuccessorMap()
|
private java.util.HashMap<att.grappa.Node,java.util.ArrayList<Successor>> |
LTSModel.getWeakSuccessorMap()
Makes a map from each node to its weak successors. |
Method parameters in dk.brics.bisim.model with type arguments of type Successor | |
---|---|
private java.util.ArrayList<Successor> |
LTSModel.filterSuccessors(java.util.ArrayList<Successor> toMap,
att.grappa.Node to)
Get the labels of in-edges of node 'to'. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |