Using Petri Nets for Memorization of the Paths at Mazes

In this paper is used classical Petri nets for modeling mazes and is presented a methodology of use of transition enabling functions Petri nets to memorize and design some or all the paths at this maze, when this maze is traveled by a simple robot. This robot must to present four sensors and the movements are crossed. The travel at maze evaluate where exist bounds generating blocking in the transitions of the generic model, and give values in a matrix that simulate the maze. These values allow the robot be guided at maze input to output, as well recognize all paths without output.