Primitive interval labelled net model and timing modelling of logic circuits

Abstract

A reduced version of the interval labeled net model called the primitive interval labeled net model is introduced. By incorporating a projection operator which is based on applying the if-then clause representation of Boolean functions to multivalued logic circuits, the primitive interval labeled net model is powerful enough to model multivalued logic circuits with timing information and all properties of the interval labeled net. This facilitates a better implementation of the verification and simulation than that using the former net model. The number of token types is reduced from four to two. This model involves simpler types of net adjacency relations. The power of the approach is demonstrated by a logic circuit implemented using logic gates with different rise and fall times.