Modelling and simulation of combinational digital circuits using Petri nets

Abstract

The P-model approach of modeling a combinational digital network using Petri nets is introduced. In this model a given logic circuit its represented by a graph With only two types of nodes, places and transitions. A logic 1 value in any line of the circuit corresponds to the presence of a so-called token, and a logic 0 corresponds to the absence of tokens, in the corresponding place of the P-model. The operation of the circuit is reflected in the execution of the P-model resulting from the firing of transitions. Several minimizing transformations in the P-model domain are discussed, which reduces the number of places and transitions by an order of magnitude. Based on this P-model representation of a logic circuit, a logic simulation algorithm is outlined. The method is faster and also simpler to implement than conventional simulation techniques.