Hello there,
I am still reading Sander Leemans' thesis, and now I wonder whether Inductive Miner - directly follows would actually ever be forced to fall through to a flower model.
Suppose there is no looping behavior. Then one would always expect to find an XOR or sequence cut.
Suppose there is looping behavior, and one can find neither a loop nor a parallel cut. Then ex hypothesi strictDfgTauLoop or dfgTauLoop would apply, until there is no more looping behavior.
Am I correct? I have not been able to construct a counterexample to my reasoning. There is no example in Sander's thesis either, as far as I can see. Perhaps I have overlooked it.
-- Sebastian
Comments
Does that sound plausible?
A DFG with start nodes a, b, c and end nodes e, g and the following edges will do:
(c,d), (d,e), (e,f), (f,d), (b,a), (a,d), (a,b), (b,d), (c,g)
dfgTauLoop would also not apply to this log.
So: I would still like to know why dfgTauLoop is not used by IM-D in ProM 6.10. Is it, because it is either always the case that it would result in a flower model if it did apply, or it would not apply at all. This would indeed a reason why it is useless. As it is not stated in Leemans' thesis, is there a paper or note mentioning this anywhere?