Memory-based implementation of a Petri net and its application to a programmable controller

In this paper, a memory-based Petri net implementation is discussed. To realize a memory-based implementation, a sub-class Petri net model is suggested. The suggested model, B-Petri net, is a marked graph whose numbers of input places and output places of a transition are limited to two. The B-Petri net has the same modeling power as a marked graph. The complexity of the B-Petri net is analyzed, and the hardware implementation architecture of a programmable controller based on it is also suggested. The memory tables have realizable memory size, and they are reduced well in case of some real applications like a programmable controller