Advertisement

Foundations of asymptotical theory of Determinate Compact Testing

  • Evgeny V. Luk-Zilberman
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 601)

Abstract

It is considered the main problem of Determinate Compact Testing (DCT): the problem of selecting of function that compresses output sequences of Tested Discrete Device (TDD). The problem of adequate probability model selection describing TDD output error is discussed and the nonhomogeneous Markov chain of arbitrary order is considered. Within this model frame the criteria of quality of realized by finite automata (FA) compressing functions is introduced. The class of asymptotical optimal FA is singled out. It is shown that probability of errors detection by belonging to this class FA tends to (M-1)/M exponentially with t, where M is number of FA states.

Description of the class of asymptotical optimal FA is also given in terms of permutation groups and it is shown that, in general, this class places strictly “between” the transitive and primitive groupe.

Class of asymptotical optimal FA realizing Checksums to Modulo M is singled out. Class of asymptotical optimal signature analyzers defined over field GF(Z) is singled out. The simple sufficient conditions describing the class of asymptotical optimal signature analyzers defined over field GF(k) (k is a prime number) are also given here.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    T.R.N. Rao, Fujiwara E. Error-control coding for computer systems. USA: Prentice-Hall, 1989, 524p.Google Scholar
  2. 2.
    R.A. Frohwerk, “Signature Analysis: A new digital field service method”, Hewlett-Packard J., 1977, vol 28, No 9, pp. 2–8.Google Scholar
  3. 3.
    Hewlett-Packard Corp. “A Designs Guide to Signature Analysis”. Appl. 222, 1978.Google Scholar
  4. 4.
    A.N. Efimov, E.V. Luk-Zilberman, “Signature Analyzers”, Avtomatika i telemekhanika, 1988, No 1, pp. 90–97.Google Scholar
  5. 5.
    A. N. Efimov, E.V. Luk-Zilberman, “The sensitive finite automata to distortions of input signals and signature analysis”, Itogi nauki i tekhniki. Ser. Tekhn. kibern., 1988, 25, pp. 135–168.Google Scholar
  6. 6.
    E.V.Luk-Zilberman, “Theory of Determinate Compact Testing”. Proc. 11th All-Union Conf. on Problems of Control, 1989, pp. 247–248.Google Scholar
  7. 7.
    A. Gill, Linear Sequential Circuits. New York: McGraw-Hill, 1966, 215p.Google Scholar
  8. 8.
    J.G. Kemeny, J.L. Snell, Finite Markov Chains. Princeton: VanNostrand, 1960, 210p.Google Scholar
  9. 9.
    M. Yinghua, K.M. Yashwant, J. Boping, “Analysis of Detection Capability of Parallel Signature Analyzers”, IEEE Trans. Comput., 1991, vol 40, No 9, pp. 1075–1081.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Evgeny V. Luk-Zilberman

There are no affiliations available

Personalised recommendations