Skip to main content
SpringerLink
Log in

The complexity of dynamic tests for functions of k-valued logic

  • Published:
Cybernetics Aims and scope

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Literature Cited

  1. I. A. Chegis and S. V. Yablonskii, “Logic checking of the operation of electrical circuits,” Tr. Mat. Inst. AN SSSR,51, 270–360 (1958).

    Google Scholar 

  2. N. A. Solov'ev, Tests (Theory, Construction, Application) [in Russian], Nauka, Novosibirsk (1978).

    Google Scholar 

  3. S.-C. Si, “Dynamic testing of redundant logic networks,” IEEE Trans., Comput.,C-27, No. 9, 828–832 (1978).

    Google Scholar 

  4. Y. Yuan and T. Chen, “The dynamic testing of combinational logic networks,” 12th Ann. Int. Symp. on Fault-Tolerant Computing(Santa Monica, Calif., June 22–24, 1982), N.Y. (1982), pp. 173–180.

  5. M. I. Ioffe, Constructing Temporal Tests for Combinational Circuits [in Russian], Dissertation, Moscow (1972).

  6. A. V. Petrosyan, “Some differential properties of Boolean functions,” Tanulmányok MTA Számitástech. Automat. Kutató Int., No. 135 (1982), pp. 15–37.

    Google Scholar 

  7. A. V. Petrosyan, “Some issues of fault-tolerance of Boolean functions” Dokl. AN ArmSSR,36, No. 3, 147–151 (1963).

    Google Scholar 

  8. V. A. Vardanyan, “On complexity of dynamic tests for Boolean functions,” Dokl. AN ArmSSR,77, No. 3, 113–116 (1983).

    Google Scholar 

  9. V. A. Vardanyan, “On complexity of dynamic tests for monotone Boolean functions,” Dokl. AN ArmSSR, 80, No. 4, 147–151 (1985).

    Google Scholar 

  10. V. A. Vardanyan (V. A. Vardanian), “On the length of single dynamic tests for monotone Boolean functions,” Proc. 5th Int. Conf., FCT'85, Lecture Notes Comput. Sci.,199, 442–449 (1985).

    Google Scholar 

  11. V. A. Vardanyan, “On complexity of single dynamic tests for monotone Boolean functions,” Kibernetika, No. 3, 23–26 (1987).

    Google Scholar 

  12. V. A. Vardanyan, “On complexity of activity tests for partial Boolean functions,” Avtomat. Telemekh., No. 7, 118–124 (1986).

    Google Scholar 

  13. V. A. Vardanyan, “On complexity of dynamic tests for functions of k-valued logic,” in: Theoretical Topics in Cybernetics [in Russian], Part 1, Saratov, Gos. Univ. (1986), pp. 40–41.

    Google Scholar 

  14. V. V. Glagolev,“Some bounds of disjunctive normal forms of Boolean functions,” Probl. Kibern., No. 19, 75–94 (1967).

    Google Scholar 

  15. V. I. Levenshtein, “Elements of coding theory,” in: Discrete Mathematics and Mathematical Topics in Cybernetics [in Russian], Nauka, Moscow (1974), pp. 207–305.

    Google Scholar 

  16. V. N. Noskov,“On complexity of tests checking the operation of inputs in logic circuits,” Diskretnyi Analiz, No. 27, 23–51 (1975).

    Google Scholar 

Download references

Authors
  1. V. A. Vardanyan
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 3, pp. 29–36, May–June, 1988.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Vardanyan, V.A. The complexity of dynamic tests for functions of k-valued logic. Cybern Syst Anal 24, 306–314 (1988). https://doi.org/10.1007/BF01132082

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation