Modeling Recursive Search Algorithms by Means of Hierarchical Colored Petri Nets and CPN Tools

This work proposes the use of Hierarchical Colored Petri Nets and CPN Tools to model the strongly recursive and iterative search algorithm called Alpha-Beta. The model produced is a visual and dynamic representation of the algorithm, where each subnet corresponds to a certain part of it. This friendly representation of the control flow and data structures of Alpha-Beta makes it more understandable, what will facilitate future analysis of the algorithm. It is important to note that other algorithm modeling-based studies are not able to cope with Alpha-Beta, due to the high number of recursive calls and conditional statements that it presents.