org.jbpt.bp.construct

Class WFTreeHandler

java.lang.Object

org.jbpt.bp.construct.WFTreeHandler

public class WFTreeHandler
extends Object

Constructor Summary

Constructors

Constructor and Description
WFTreeHandler(NetSystem netClone)

Method Summary

Methods

Modifier and Type	Method and Description
boolean	areCooccurring(Node t1, Node t2) Check if two Petri net nodes are in co-occurrence relation (>>)
boolean	areExclusive(Node t1, Node t2) Check if two Petri net nodes are in exclusive relation (+)
boolean	areInOrder(Node t1, Node t2) Check if two Petri net nodey are in order relation
boolean	areInStrictOrder(Node t1, Node t2) Check if two Petri net nodes are in strict order relation (->)
boolean	areInterleaving(Node t1, Node t2) Check if two Petri net nodes are in interleaving relation (||)
int	getOrder(org.jbpt.algo.tree.rpst.IRPSTNode<Flow,Node> node) Get order of a node in a parent sequence A partial function, defined for nodes with a parent node of type polygon
RelSetType	getRelationForNodes(Node t1, Node t2)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

WFTreeHandler

public WFTreeHandler(NetSystem netClone)

Method Detail

getOrder

public int getOrder(org.jbpt.algo.tree.rpst.IRPSTNode<Flow,Node> node)

Get order of a node in a parent sequence A partial function, defined for nodes with a parent node of type polygon

Parameters:

node - a node to get position for

Returns:

position of a node in a parent sequence (S) node starting from 0, or -1 if order is not defined for this node

areInStrictOrder

public boolean areInStrictOrder(Node t1,
                       Node t2)

Check if two Petri net nodes are in strict order relation (->)

Parameters:

t1 - Petri net node

t2 - Petri net node

Returns:

true if t1->t2, false otherwise

areInOrder

public boolean areInOrder(Node t1,
                 Node t2)

Check if two Petri net nodey are in order relation

Parameters:

t1 - Petri net node

t2 - Petri net node

Returns:

true if t1->t2 or t2->t1, false otherwise

areExclusive

public boolean areExclusive(Node t1,
                   Node t2)

Check if two Petri net nodes are in exclusive relation (+)

Parameters:

t1 - Petri net node

t2 - Petri net node

Returns:

true if t1+t2, false otherwise

areInterleaving

public boolean areInterleaving(Node t1,
                      Node t2)

Check if two Petri net nodes are in interleaving relation (||)

Parameters:

t1 - Petri net node

t2 - Petri net node

Returns:

true if t1||t2, false otherwise

areCooccurring

public boolean areCooccurring(Node t1,
                     Node t2)

Check if two Petri net nodes are in co-occurrence relation (>>)

Parameters:

t1 - Petri net node

t2 - Petri net node

Returns:

true if t1>>t2, false otherwise

getRelationForNodes

public RelSetType getRelationForNodes(Node t1,
                             Node t2)