I have a couple of questions regarding the flexible heuristics miner resp. its implementation in ProM6:
Can you tell how the selection strategy for the splits/joins in the augmented C-Net is implemented according to http://cms.ieis.tue.nl/Beta/Files/WorkingPapers/wp_334.pdf? Sorry if there's a misunderstanding from my side, but I also did not get how exactly the split/join gateways are derived from the augmented C-Net. Is it as straightforwards as in http://is.tm.tue.nl/staff/aweijters/LNCS3812.pdf (p.5) or more sophisticated? And are the low frequent patterns in the augmented C-net taken into account? If not, what's the threshold?