public void FindFirstCommonSuccessorTest()
{
var eventLog = EventLogExample.ComplexEventLogVanDerAalst();
var field = new Field {
EventLog = eventLog
};
var miner = new HeuristicMiner(field);
var event1 = eventLog.Cases[0].EventList[0];
var event2 = eventLog.Cases[0].EventList[1];
var event3 = eventLog.Cases[0].EventList[2];
var eventNode1 = new EventNode(event1, 0.8, new List <EventNode> {
new EventNode(event2, 0.8, new List <EventNode> {
new EventNode(event3, 0.8)
})
});
var eventNode2 = new EventNode(event1, 0.8, new List <EventNode> {
new EventNode(event2, 0.8, new List <EventNode> {
new EventNode(event3, 0.8)
})
});
var actual = miner.FindFirstCommonSuccessor(new List <EventNode> {
eventNode1, eventNode2
});
Assert.AreEqual("C", actual);
}
public void MineTest2()
{
MinerSettings.AddOrUpdateKey("AdjacencyThresholdSlider", 51);
MinerSettings.AddOrUpdateKey("MaximumRecursionDepthSlider", 10);
var field = new Field {
EventLog = EventLogExample.ComplexEventLogVanDerAalst()
};
var miner = new HeuristicMiner(field);
PetriNet actual = (PetriNet)miner.Mine();
Assert.AreEqual(33, actual.Transitions.Count);
Assert.AreEqual("D", actual.Transitions[2].Name);
Assert.AreEqual(44, actual.Places.Count);
// Assert.AreEqual("End", actual.Places[].Name);
}
public void IsAndRelationTest()
{
var eventLog = EventLogExample.ComplexEventLogVanDerAalst();
var field = new Field {
EventLog = eventLog
};
var miner = new HeuristicMiner(field);
var event1 = eventLog.Cases[0].EventList[0];
var event2 = eventLog.Cases[0].EventList[1];
var event3 = eventLog.Cases[0].EventList[2];
var actual = miner.IsAndRelation(event1, event2, event3, eventLog);
Assert.IsTrue(actual);
}
