dk.brics.bisimulationGame.equiv
Class PairGraph

java.lang.Object
  extended by dk.brics.bisimulationGame.equiv.PairGraph

public class PairGraph
extends java.lang.Object

A pair graph represents the possible combinations of transitions from two LTSs (S,T), and holds a strategy for an attacker. It is used by an attacker to compute a winning strategy, which is a path from the initial configuration (S_init, T_init) to an accept node. All edges into the accept node represents steps that can only occur in one of the two LTSs, hence will make the defender lose. In a pair graph, each node is made up of two nodes, from the left and right LTS. An edge records actions and block numbers of target states. A pair graph is constructed from a partitioned state space. At construction, the pair graph is build, and the attacker strategy is computed.

Author:
Martin Mosegaard martinm@daimi.au.dk

Constructor Summary
PairGraph(StateSpace ss)
           
 
Method Summary
 Strategy getStrategy(att.grappa.Node left, att.grappa.Node right)
          Returns the strategy at the node pair (left, right).
 java.lang.String toString()
           
 
Methods inherited from class java.lang.Object
equals, getClass, hashCode, notify, notifyAll, wait, wait, wait
 

Constructor Detail

PairGraph

public PairGraph(StateSpace ss)
Method Detail

getStrategy

public Strategy getStrategy(att.grappa.Node left,
                            att.grappa.Node right)
Returns the strategy at the node pair (left, right).

Parameters:
left -
right -
Returns:

toString

public java.lang.String toString()
Overrides:
toString in class java.lang.Object