This is very well explained, thanks for your efforts to share this important knowledge. we will make together this world a better place - with process mining as well.
Line 4 of the algorithm uses the all-quantor for both A and B. This would mean that element i in set A must be causally related to all elements in B, and this for every i. Figure at 3:05 does not show this. But your example makes it obvious.
b and c are not independent of one another, so this set isn't possible. For ({A}, {B}), all entities within A and B must be independent of one another and A and B must have a casual relation
how can we convert this petri net logic to BPMN flow...If I have to discover BPMN process model how would I know which one is XOR/parallel gateways from Petri net outcome?
There's no need to look any further, this is the best video on Alpha Algorithm on UA-cam. Thank you kind sir!
Thanks for the appreciation! Glad to hear it helps!
Thank you, this is great!
Nice explanation
Very good explanation! Thank you!
Omg thank you so much, I have an exam soon and I completly understand the algo thanks to you ! very clear :)
Thanks for the video !
But one thing intrigues me: why don't you write: ({a}, {b, c, e}) instead of cutting it in two ?
Thank you very much for your explanation! It helped me a lot with me diploma
Well explained. Thanks
Thank you!Very well explained!
thank you for the explanation
for the possibles sets, why don't you put b,c and c,b ? Are they irrelevant ?
This is very well explained, thanks for your efforts to share this important knowledge. we will make together this world a better place - with process mining as well.
Thank you! Really useful
Line 4 of the algorithm uses the all-quantor for both A and B. This would mean that element i in set A must be causally related to all elements in B, and this for every i. Figure at 3:05 does not show this. But your example makes it obvious.
Very good explanation! Thank you very much :)
Well done!
In step 4, why no ({b,c,e},{d})?
b and c are not independent of one another, so this set isn't possible.
For ({A}, {B}), all entities within A and B must be independent of one another and A and B must have a casual relation
how can we convert this petri net logic to BPMN flow...If I have to discover BPMN process model how would I know which one is XOR/parallel gateways from Petri net outcome?
You'd need the matrix for that. When it has a parallel sign you use the AND gate and when it has the hashtag sign you use the XOR gate.
Thank you for this very good and understandable video!
I got it :)
Lekker videootje hoor, 'vo
Thanks a ton!
I LOVE IT, Thank You for helping me :)
i love you
My university teacher stole this 1:1 and explained it way worse...