Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

Reduction in the number of LUT elements for control units with code sharing

Alexander BarkalovLarysa TitarenkoJacek Bieganowski — 2010

International Journal of Applied Mathematics and Computer Science

Two methods are proposed targeted at reduction in the number of look-up table elements in logic circuits of compositional microprogram control units (CMCUs) with code sharing. The methods assume the application of field-programmable gate arrays for the implementation of the combinational part of the CMCU, whereas embedded-memory blocks are used for implementation of its control memory. Both methods are based on the existence of classes of pseudoequivalent operational linear chains in a microprogram...

Detection of deadlocks and traps in Petri nets by means of Thelen's prime implicant method

Agnieszka WęgrzynAndrei KaratkevichJacek Bieganowski — 2004

International Journal of Applied Mathematics and Computer Science

A new method of detecting deadlocks and traps in Petri nets is presented. Deadlocks and traps in Petri nets can be represented by the roots of special equations in CNF form. Such equations can be solved by using the search tree algorithm proposed by Thelen. In order to decrease the tree size and to accelerate the computations, some heuristics for Thelen's method are presented.

Page 1

Download Results (CSV)