org.jbpt.petri.wftree.AbstractWFTree Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of jbpt-petri Show documentation
The jBPT code library is a compendium of technologies that support research on design, execution, and evaluation of business processes.
The newest version!
package org.jbpt.petri.wftree;

import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Set;

import org.jbpt.algo.tree.rpst.IRPSTNode;
import org.jbpt.algo.tree.rpst.RPST;
import org.jbpt.algo.tree.tctree.TCType;
import org.jbpt.petri.IFlow;
import org.jbpt.petri.INode;
import org.jbpt.petri.IPetriNet;
import org.jbpt.petri.IPlace;
import org.jbpt.petri.ITransition;


/**
 * This class takes a net and computes its WF-tree (abstract implementation).


 *
 * WF-tree was proposed in:
 * Matthias Weidlich, Artem Polyvyanyy, Jan Mendling, and Mathias Weske.
 * Causal Behavioural Profiles - Efficient Computation, Applications, and Evaluation. 
 * Fundamenta Informaticae (FUIN) 113(3-4): 399-435 (2011)
 * 
 * @author Artem Polyvyanyy
 * @author Matthias Weidlich
 */
public abstract class AbstractWFTree, N extends INode,
					P extends IPlace, T extends ITransition> extends RPST implements IWFTree {

	private Map,WFTreeBondType> bond2type = null;
	private Map,WFTreeLoopOrientationType> loop2type = null;
	
	public AbstractWFTree(IPetriNet net) {
		super(net);
		
		this.bond2type = new HashMap,WFTreeBondType>();
		this.loop2type = new HashMap,WFTreeLoopOrientationType>();
	}
	
	@Override
	public WFTreeBondType getRefinedBondType(IRPSTNode node) {
		if (node.getType()!=TCType.BOND)
			return WFTreeBondType.UNDEFINED;
		else {
			WFTreeBondType type = this.bond2type.get(node);
			if (type!=null) return type;
			else {
				INode entry = node.getEntry();
				INode exit = node.getExit();
				
				if (entry==null || exit == null)
					return WFTreeBondType.UNDEFINED;
				
				for (IRPSTNode child : this.getChildren(node)) {
					if (child.getEntry().equals(node.getExit())) {
						type = WFTreeBondType.LOOP;
						this.bond2type.put(node,type);
						return type;
					}
				}
				
				if (entry instanceof ITransition && exit instanceof ITransition) {
					type = WFTreeBondType.TRANSITION_BORDERED;
					this.bond2type.put(node,type);
					return type;
				}
				
				if (entry instanceof IPlace && exit instanceof IPlace) {
					type = WFTreeBondType.PLACE_BORDERED;
					this.bond2type.put(node,type);
					return type;
				}
				
				return WFTreeBondType.UNDEFINED;
			}
		}
	}
	
	@Override
	public WFTreeLoopOrientationType getLoopOrientationType(IRPSTNode node) {
		if (this.isRoot(node)) return WFTreeLoopOrientationType.UNDEFINED;
		
		WFTreeLoopOrientationType type = this.loop2type.get(node);
		if (type!=null) return type;
		
		if (this.getRefinedBondType(this.getParent(node))!=WFTreeBondType.LOOP)
			return WFTreeLoopOrientationType.UNDEFINED;
		
		if (node.getEntry().equals(this.getParent(node).getEntry())) {
			type = WFTreeLoopOrientationType.FORWARD;
			this.loop2type.put(node,type);
			return type;
		}
		
		if (node.getEntry().equals(this.getParent(node).getExit())) {
			type = WFTreeLoopOrientationType.BACKWARD;
			this.loop2type.put(node,type);
			return type;
		}	
		
		return WFTreeLoopOrientationType.UNDEFINED;
	}
	
	@Override
	public Set> getRPSTNodes(WFTreeBondType type) {
		Set> result = new HashSet>();
		for (IRPSTNode node : this.getVertices())
			if (this.getRefinedBondType(node)==type)
				result.add(node);
		
		return result;
	}
}