Skip to main content
SpringerLink
Log in

Foundations of asymptotical theory of Determinate Compact Testing

  • Conference paper
  • First Online:
Theory of Computing and Systems (ISTCS 1992)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 601))

Included in the following conference series:

  • 118 Accesses

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.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. T.R.N. Rao, Fujiwara E. Error-control coding for computer systems. USA: Prentice-Hall, 1989, 524p.

    Google Scholar 

  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. Hewlett-Packard Corp. “A Designs Guide to Signature Analysis”. Appl. 222, 1978.

    Google Scholar 

  4. A.N. Efimov, E.V. Luk-Zilberman, “Signature Analyzers”, Avtomatika i telemekhanika, 1988, No 1, pp. 90–97.

    Google Scholar 

  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. 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. A. Gill, Linear Sequential Circuits. New York: McGraw-Hill, 1966, 215p.

    Google Scholar 

  8. J.G. Kemeny, J.L. Snell, Finite Markov Chains. Princeton: VanNostrand, 1960, 210p.

    Google Scholar 

  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 

Download references

Authors
  1. Evgeny V. Luk-Zilberman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

D. Dolev Z. Galil M. Rodeh

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Luk-Zilberman, E.V. (1992). Foundations of asymptotical theory of Determinate Compact Testing. In: Dolev, D., Galil, Z., Rodeh, M. (eds) Theory of Computing and Systems. ISTCS 1992. Lecture Notes in Computer Science, vol 601. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035178

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55553-7

  • Online ISBN: 978-3-540-47214-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation