Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

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

100%

Węgrzyn A., Karatkevich A., Bieganowski J.

International Journal of Applied Mathematics and Computer Science

2004

tom 14

nr 1

113-121

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.

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

100%

Barkalov A., Titarenko L., Bieganowski J.

International Journal of Applied Mathematics and Computer Science

2010

tom 20

nr 4

751-761

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 to be implemented. Conditions for the application of the proposed methods and examples of design are shown. Results of conducted experiments are given.

Ograniczanie wyników

2 International Journal of Applied Mathematics and Computer Science

2 Bieganowski J.

1 Barkalov A.

1 Karatkevich A.

1 Titarenko L.

1 Węgrzyn A.

1 2010

1 2004

Wyniki wyszukiwania

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

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