dk.brics.bisimulationGame.equiv
Class Successor
java.lang.Object
dk.brics.bisimulationGame.equiv.Successor
public class Successor
- extends java.lang.Object
The successor of a node. It consists of the edge and the to-node.
A weak successor is one that an attacker may not choose.
A weak successor does not have a Grappa Edge.
Used in successor maps.
- Author:
- Martin Mosegaard martinm@daimi.au.dk
Field Summary |
private att.grappa.Edge |
edge
|
private java.lang.String |
edgeLabel
|
private boolean |
isWeak
|
private att.grappa.Node |
toNode
|
Constructor Summary |
Successor(att.grappa.Edge edge,
java.lang.String edgeLabel,
att.grappa.Node toNode)
Constructs a strong successor. |
Successor(java.lang.String edgeLabel,
att.grappa.Node toNode)
Constructs a successor that may be weak. |
Methods inherited from class java.lang.Object |
clone, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
edge
private att.grappa.Edge edge
edgeLabel
private java.lang.String edgeLabel
toNode
private att.grappa.Node toNode
isWeak
private boolean isWeak
Successor
public Successor(att.grappa.Edge edge,
java.lang.String edgeLabel,
att.grappa.Node toNode)
- Constructs a strong successor.
- Parameters:
edge
- An edgeedgeLabel
- The label of the edgetoNode
- A to-node
Successor
public Successor(java.lang.String edgeLabel,
att.grappa.Node toNode)
- Constructs a successor that may be weak.
- Parameters:
edgeLabel
- An edge labeltoNode
- A to-node
getToNode
public att.grappa.Node getToNode()
- Returns:
- The to-node
equals
public boolean equals(java.lang.Object other)
- Overrides:
equals
in class java.lang.Object
equals
private boolean equals(Successor other)
toString
public java.lang.String toString()
- Overrides:
toString
in class java.lang.Object
isWeak
public boolean isWeak()
- Returns:
- If the successor is weak
getEdgeLabel
public java.lang.String getEdgeLabel()
- Returns:
- The edge label
getEdge
public att.grappa.Edge getEdge()
- Returns:
- The edge