Skip to main content
Log in

A covering procedure for a logical structure

  • Published:
CALCOLO Aims and scope Submit manuscript

Summary

This report presents a covering algorithm for the implementation of logical structures by means of building-blocks of given types.

The results obtained through the algorithm are not rigorously optimal, but compare very favourably with those obtained by expert designers.

A specific example is handled with details on the logical structure and algorithm specifications.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. F-signals are operated in pairs in order to avoid splitting a FLIP-FLOP in different b.b.'s.

  2. The meaning of «covering trial on aV-signal», «positive trial», «accepted b.b.», «successful trial», are similar to those for the case ofF-signals; the same holds for theU-signals.

  3. We write XX51 and not XX51″ in order to facilitate the execution of connections among b.b.'s.

Download references

Author information

Authors and Affiliations

Authors

Additional information

The three autors have worked very closely on the entire project, all sections are the result of this cooperation.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Falleni, M., Frisiani, A.L. & Lerda, F. A covering procedure for a logical structure. Calcolo 4, 275–293 (1967). https://doi.org/10.1007/BF02576738

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02576738

Keywords

Navigation