org.processmining.incorporatenegativeinformation.algorithms

Class PN2DfgTransform

java.lang.Object

org.processmining.incorporatenegativeinformation.algorithms.PN2DfgTransform

public class PN2DfgTransform
extends java.lang.Object

Constructor Summary

Constructors

Constructor and Description
PN2DfgTransform()

Method Summary

Modifier and Type	Method and Description
static void	addDirectFollow(org.processmining.plugins.InductiveMiner.dfgOnly.Dfg dfg, org.processmining.models.graphbased.directed.transitionsystem.ReachabilityGraph rg) we have modification to deal with silent transitions.
static void	addStartEnd(org.processmining.plugins.InductiveMiner.dfgOnly.Dfg dfg, org.processmining.models.graphbased.directed.transitionsystem.ReachabilityGraph rg, org.processmining.models.graphbased.directed.transitionsystem.StartStateSet startStates, org.processmining.models.graphbased.directed.transitionsystem.AcceptStateSet acceptingStates)
static void	setCardinality(org.processmining.plugins.InductiveMiner.dfgOnly.Dfg dfg, long cardinality)
static org.processmining.plugins.InductiveMiner.dfgOnly.Dfg	transformPN2Dfg(org.processmining.framework.plugin.PluginContext context, org.processmining.models.graphbased.directed.petrinet.Petrinet net, org.processmining.models.semantics.petrinet.Marking marking)

Methods inherited from class java.lang.Object

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

Constructor Detail

PN2DfgTransform

public PN2DfgTransform()

Method Detail

transformPN2Dfg

public static org.processmining.plugins.InductiveMiner.dfgOnly.Dfg transformPN2Dfg(org.processmining.framework.plugin.PluginContext context,
                                                                                   org.processmining.models.graphbased.directed.petrinet.Petrinet net,
                                                                                   org.processmining.models.semantics.petrinet.Marking marking)
                                                                            throws org.processmining.framework.connections.ConnectionCannotBeObtained

Throws:

org.processmining.framework.connections.ConnectionCannotBeObtained

addStartEnd

public static void addStartEnd(org.processmining.plugins.InductiveMiner.dfgOnly.Dfg dfg,
                               org.processmining.models.graphbased.directed.transitionsystem.ReachabilityGraph rg,
                               org.processmining.models.graphbased.directed.transitionsystem.StartStateSet startStates,
                               org.processmining.models.graphbased.directed.transitionsystem.AcceptStateSet acceptingStates)

addDirectFollow

public static void addDirectFollow(org.processmining.plugins.InductiveMiner.dfgOnly.Dfg dfg,
                                   org.processmining.models.graphbased.directed.transitionsystem.ReachabilityGraph rg)

we have modification to deal with silent transitions. We need to find out the silent transition t. something, not so nice to check, I'd like to say.. [S1]--> [tau, specific for one branch to connect?? ]-->[T1], specific connection for it so we connect the S1-->T1, and create the directly follows relation but one missing part, if there are more than one silent transitions between them, then the connection gets lost. SO we need to check them links, do it in the following way: --- allow all silent transitions in the states and get the directly-follows relation' --- for any connected to the silent transition, S1-->tau_i, tau_j --> T1, tau_i--> tau_j --- we need to do the combination of them.. for S1-->tau_i, find all [T1...Tn, tau_1,..tau_m] relation with tau_i, tau_i --> ?? if(it is [T1,T2...Tn]), then connect S1-->Ti if(in [tau_1...tau_m]) go breadth search for tau_j stops at un silent transitions

Parameters:

dfg -

rg -

setCardinality

public static void setCardinality(org.processmining.plugins.InductiveMiner.dfgOnly.Dfg dfg,
                                  long cardinality)