Abstract
A technique exploiting the modern concepts of Petri nets for simplification of Boolean functions is proposed. The firing concept of Petri nets has been utilized to give a Petri net interpretation to certain properties of switching algebra. These Petri net interpreted properties are then used for the simplification process. Unlike the existing method, the proposed technique does not require the functions to be expressed explicitly in a canonical form. This alleviates the computational efforts. It is simple and amenable for computer programming implementation.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
