In this article we present an algorithm to transform a set(s) of Boolean equations into a Petri net(s). Boolean logic provides a mathematical basis for switching control and many other areas. In the case of programmable logic controllers used for the sequential control in manufacturing applications, Boolean equations are fundamental both in programming and in understanding their operation. A major difficulty with Boolean equations is the lack of any type of mathematical theory for the analysis of the systems that are being represented by these equations. Petri nets, on the other hand, possess a mathematical framework to analyze the properties of the system being modeled. Furthermore, Petri nets have been proved to be appropriate models for sequential control. The popularity as well as the generality of Boolean logic, on one hand, and the modeling and analytical capabilities of Petri nets, on the other hand, are the major motivations for this research.