Skip to main content
SpringerLink
Log in

Estimating a Polyhedron Method Informativeness in the Problem of Checking the Automaton by the Statistical Properties of the Input and Output Sequences

  • Conference paper
  • First Online:
Distributed Computer and Communication Networks (DCCN 2022)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1748))

  • 230 Accesses

Abstract

The problem of verification of the Moore finite state machine by the statistical properties of the input and output sequences is considered. It is assumed that the initial state of the automaton is unknown. To verify the automaton, the polyhedra method is used. The results of computational experiments for four classes of non-autonomous binary shift registers are presented.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Bhattacharjee, K., Maity, K., Das, S.: A search for good pseudo-random number generators: survey and empirical studies (2018). https://doi.org/10.48550/ARXIV.1811.04035

  2. Bryant, P.R., Christensen, J.: The enumeration of shift register sequences. J. Comb. Theory Ser. A 35, 154–172 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  3. Fischer, T.: Testing cryptographically secure pseudo random number generators with artificial neural networks. In: 2018 17th IEEE International Conference on Trust, Security and Privacy in Computing and Communications/12th IEEE International Conference on Big Data Science and Engineering (TrustCom/BigDataSE), pp. 1214–1223 (2018). https://doi.org/10.1109/TrustCom/BigDataSE.2018.00168

  4. Galustov, G.G., Voronin, V.V.: The synthesis of the correlation function of pseudorandom binary numbers at the output shift register. In: Kadar, I. (ed.) Signal Processing, Sensor/Information Fusion, and Target Recognition XXVI, vol. 10200, p. 102001G. International Society for Optics and Photonics, SPIE (2017). https://doi.org/10.1117/12.2263590

  5. Golomb, S.: Shift Register Sequences, 3rd edn. World Scientific, Singapore (2017)

    Book  MATH  Google Scholar 

  6. Imase, M., Itoh, M.: Design to minimize diameter on building-block network. IEEE Trans. Comput. 30(6), 439–442 (1981). https://doi.org/10.1109/TC.1981.1675809

    Article  MathSciNet  MATH  Google Scholar 

  7. Johnson, D.B.: Finding all the elementary circuits of a directed graph. SIAM J. Comput. 4(1), 77–84 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  8. Li, Y., Hadjicostis, C.N., Wu, N., Li, Z.: Error- and tamper-tolerant state estimation for discrete event systems under cost constraints (2020). https://doi.org/10.48550/ARXIV.2011.01371

  9. Melnikov, S.Y., Samouylov, K.E.: Statistical properties of binary nonautonomous shift registers with internal XOR. Inform. Appl. 14(2), 80–85 (2020). https://doi.org/10.14357/19922264200211

    Article  Google Scholar 

  10. Melnikov, S.Y., Samouylov, K.E.: Polygons characterizing the joint statistical properties of the input and output sequences of the binary shift register. In: The 4th International Conference on Future Networks and Distributed Systems (ICFNDS 2020), pp. 1–6. Association for Computing Machinery, New York, USA (2020). https://doi.org/10.1145/3440749.3442601

  11. Melnikov, S.Y., Samouylov, K.E.: Polyhedra of finite state machines and their use in the identification problem. In: NEW2AN/ruSMART -2020. LNCS, vol. 12526, pp. 110–121. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-65729-1_10

    Chapter  Google Scholar 

  12. Potii, O., Poluyanenko, N., Petrenko, A., Pidkhomnyi, O., Florov, S., Kuznetsova, T.: Boolean functions for stream ciphers. In: 2019 IEEE 2nd Ukraine Conference on Electrical and Computer Engineering (UKRCON), pp. 942–946 (2019). https://doi.org/10.1109/UKRCON.2019.8879862

  13. Read, R.C.: Graph Theory and Computing. Academic Press, NY (2014)

    Google Scholar 

  14. Serov, A.A., Zubkov, A.M.: Testing the NIST statistical test suite on artificial pseudorandom sequences. In: Proceedings of the XII International Conference on Computer Data Analysis and Modeling: Stochastics and Data Science (Minsk, 18–22 September 2019), pp. 291–294. Publishing Center of BSU, Minsk (2019)

    Google Scholar 

  15. Sevastyanov, B.A.: The conditional distribution of the output of an automaton without memory for given characteristics of the input. Discret. Math. Appl. 4(1), 1–6 (1994). https://doi.org/10.1515/dma.1994.4.1.1

    Article  MathSciNet  MATH  Google Scholar 

  16. Wolfram, S.: The Mathematica Book. Assembly Automation (1999)

    Google Scholar 

  17. Zaytoon, J., Lafortune, S.: Overview of fault diagnosis methods for discrete event systems. Annu. Rev. Control. 37(2), 308–320 (2013). https://doi.org/10.1016/j.arcontrol.2013.09.009

    Article  Google Scholar 

  18. Zubkov, A.M., Serov, A.A.: A natural approach to the experimental study of dependence between statistical tests. Matem. Vopr. Kriptogr 12(1), 131–142 (2021). https://doi.org/10.4213/mvk352

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

This paper has been supported by the RUDN University Strategic Academic Leadership Program.

Author information

Authors and Affiliations

  1. Peoples’ Friendship University of Russia (RUDN University), Moscow, Russia

    S. Yu. Melnikov & K. E. Samouylov

  2. MIREA – Russian Technological University, Moscow, Russia

    A. V. Zyazin

Authors
  1. S. Yu. Melnikov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. E. Samouylov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. V. Zyazin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to S. Yu. Melnikov .

Editor information

Editors and Affiliations

  1. V. A. Trapeznikov Institute of Control Sciences of RAS, Moscow, Russia

    Vladimir M. Vishnevskiy

  2. RUDN University, Moscow, Russia

    Konstantin E. Samouylov

  3. V. A. Trapeznikov Institute of Control Sciences of RAS, Moscow, Russia

    Dmitry V. Kozyrev

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Melnikov, S.Y., Samouylov, K.E., Zyazin, A.V. (2023). Estimating a Polyhedron Method Informativeness in the Problem of Checking the Automaton by the Statistical Properties of the Input and Output Sequences. In: Vishnevskiy, V.M., Samouylov, K.E., Kozyrev, D.V. (eds) Distributed Computer and Communication Networks. DCCN 2022. Communications in Computer and Information Science, vol 1748. Springer, Cham. https://doi.org/10.1007/978-3-031-30648-8_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-30648-8_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-30647-1

  • Online ISBN: 978-3-031-30648-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation