In: Int. J. Syst. Sci., Vol. 21, No. 8, pages 1503-1513. August 1990.
Abstract: The P-model approach of modelling a combinational digital network using Petri nets is introduced. A logic 1 value in any line of the circuit corresponds to the presence of a token, and a logic 0 corresponds to the absence of tokens. The operation of the circuit is reflected on 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 the 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.
Keywords: combinational digital circuits modelling (by nets); minimizing transformations (in) net models; logic simulation algorithm.