org.processmining.converting.wfnet2bpel4ws
Class PetriNetNavigation

java.lang.Object
  extended by org.processmining.converting.wfnet2bpel4ws.PetriNetNavigation

public class PetriNetNavigation
extends java.lang.Object

This class is a toolbox for getting information out of a Petri net. Preferbly they should have been implemented in the Petri net datastructure but due to difficulties in doing that, they are put here for now.

Author:
Kristian Bisgaard Lassen

Constructor Summary
PetriNetNavigation()
           
 
Method Summary
static java.util.LinkedList<att.grappa.Node> getIncomingNodes(att.grappa.Node node)
          Returns all nodes that has an arc to the input node
static java.util.LinkedList<att.grappa.Node> getIncomingNodesOfIncomingNodes(att.grappa.Node aNode)
          Returns all nodes that can reach the input node in two steps
static java.util.Vector<Place> getIncomingPlaces(att.grappa.Node n)
           
static java.util.LinkedHashSet<Transition> getIncomingTransitions(att.grappa.Node n)
           
static java.util.LinkedList<att.grappa.Node> getOutgoingNodes(att.grappa.Node node)
          Returns all nodes that has an arc from the output node
static java.util.LinkedList<att.grappa.Node> getOutgoingNodesOfOutgoingNodes(att.grappa.Node aNode)
          Returns the all nodes that can be reached in two steps from the input node
static java.util.Vector<Place> getOutgoingPlaces(att.grappa.Node n)
           
static java.util.Vector<Transition> getOutgoingTransitions(att.grappa.Node n)
           
static Transition getTransition(att.grappa.Edge arc)
          Returns the transition end of the input arc
 
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Constructor Detail

PetriNetNavigation

public PetriNetNavigation()
Method Detail

getIncomingNodes

public static java.util.LinkedList<att.grappa.Node> getIncomingNodes(att.grappa.Node node)
Returns all nodes that has an arc to the input node

Parameters:
node - - A node
Returns:
A collection of the incoming nodes

getIncomingNodesOfIncomingNodes

public static java.util.LinkedList<att.grappa.Node> getIncomingNodesOfIncomingNodes(att.grappa.Node aNode)
Returns all nodes that can reach the input node in two steps

Parameters:
aNode - - A node
Returns:
A collection of nodes that can reach the input node in two steps

getOutgoingNodes

public static java.util.LinkedList<att.grappa.Node> getOutgoingNodes(att.grappa.Node node)
Returns all nodes that has an arc from the output node

Parameters:
node - - A node
Returns:
A collection of outgoing nodes

getOutgoingNodesOfOutgoingNodes

public static java.util.LinkedList<att.grappa.Node> getOutgoingNodesOfOutgoingNodes(att.grappa.Node aNode)
Returns the all nodes that can be reached in two steps from the input node

Parameters:
aNode - - A node
Returns:
A collection of nodes that can be reached in two steps from this node

getOutgoingPlaces

public static java.util.Vector<Place> getOutgoingPlaces(att.grappa.Node n)
See Also:
getOutgoingNodes(Node)

getIncomingPlaces

public static java.util.Vector<Place> getIncomingPlaces(att.grappa.Node n)
See Also:
getIncomingNodes(Node)

getOutgoingTransitions

public static java.util.Vector<Transition> getOutgoingTransitions(att.grappa.Node n)
See Also:
getOutgoingNodes(Node)

getIncomingTransitions

public static java.util.LinkedHashSet<Transition> getIncomingTransitions(att.grappa.Node n)
See Also:
getIncomingNodes(Node)

getTransition

public static Transition getTransition(att.grappa.Edge arc)
Returns the transition end of the input arc

Parameters:
arc - - An arc
Returns:
A transition of the input arc