Dear Eric.,

I have a beginner question about  Petri Net models that  are output
of Alpha algorithm, are they  directed multi graphs ? I think , output of
Alpha algorithm can be a cyclic graph ,is it true?

Do you know an algorithm that can find all paths form start node to end node in
these graphs?

I am new to the process mining field and have a general idea
of how the alpha-algorithm works. I am looking at a problem in which the tasks
/ events in the process to be discovered have temporal and geo-spatial extent.
I can see how the geo-spatial features can be incorporated into the task itself
(i.e., task-1-at-location-x, task-2-at-location-x, task-1-at-location-y), but
was wondering if there is an algorithm that explicitly takes into account the
geo-spatial properties of a task.

Thanks,

Tim Darr