Abstract
The development of nanoscale technology for integrated circuit chips highlights the reliability of circuit reliability. The path formed by the basic unit of the circuit has a significant influence on the overall reliability of the circuit. Therefore, it is necessary to quickly and effectively locate the path to understand the difference in reliability between logic circuits of different structures in time. Combined with the Monte Carlo tree search strategy and based on relaxation operations, this paper realizes the rapid location of sensitive paths in the combinational circuit while ensuring the accurate location of sensitive paths.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Xiao, J., Jiang, J.H., Li, X.X., et al.: A novel trust evaluation method for logic circuits in IoT applications based on the E-PTM model. IEEE Access 6(7), 35683–35696 (2018)
Sridharan, K.: A transistor-level probabilistic approach for reliability analysis of arithmetic circuits with applications to emerging technologies. IEEE Trans. Reliab. 66(2), 440–457 (2017)
Xiao, J., Lee, W., Jiang, J.H., et al.: Sensitivity evaluation of input vectors with masking effects in digital circuits. Chin. J. Comput. 41(10), 2282–2294 (2018)
Bickford, J., Habib, N., Li, B., et al.: Integrated circuit chip reliability qualification using a sample-specific expected fail rate. USA Patent (2018)
Han, J., Hao, C., Liang, J.H., et al.: A stochastic computational approach for accurate and efficient reliability evaluation. IEEE Trans. Comput. 63(6), 1336–1350 (2014)
Abramovici, M., Menon, P.R., Miller, D.T.: Critical path tracing: an alternative to fault simulation. IEEE Des. Test Comput. 1(1), 83–93 (1984)
Menon, P.R., Levendel, Y., Abramovici, M.: Critical path tracing in sequential circuits. In: IEEE International Conference on Computer-aided Design, ICCAD-88 Digest of Technical Papers. IEEE (1988)
Favalli, M., Olivo, P.: A novel critical path heuristic for fast fault grading. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 10(4), 544–548 (1991)
Girard, P., Landrault, C., Pravossoudovitch, S.: A reconvergent fan-out analysis for the CPT algorithm used in delay-fault diagnosis. In: European Test Conference. IEEE (1993)
Wu, L., Walker, D.M.H.: A fast algorithm for critical path tracing in VLSI digital circuits. In: 20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems, 2005. DFT 2005. IEEE (2005)
Bosio, A., Girard, P., Pravossoudovitch, S.: An exact and efficient critical path tracing algorithm. In: Fifth IEEE International Symposium on Electronic Design, Test and Application, 2010. DELTA 2010. IEEE (2010)
Pang, Chaoyi., Junhu Wang, Yu., Cheng, Haolan Zhang, Li, Tongliang: Topological sorts on DAGs. Inf. Process. Lett. 115(2), 298–301 (2015)
Bayer, K., Koch, S., Klein, R.: Monte carlo tree search. Wirtschaftswissenschaftliches studium 47(12), 11–18 (2018)
Wang, D.T.: An algorithm for the generation of test sets for combinational logic networks. IEEE Trans. Comput. C-24(7), 742–746 (1975)
Xiao, J., Shi, Z.H., Jiang, J.H., et al.: A locating method for reliability-critical gates with a parallel-structured genetic algorithm. J. Comput. Sci. Technol. 34(5), 1136–1151 (2019)
Silver, D., Schrittwieser, J., Simonyan, K., et al.: Mastering the game of Go without human knowledge. Nature 550(7676), 354–359 (2017)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Sun, Z., Ji, Q., Wu, Z., Liu, A. (2020). A Location Method for Reliability-Critical Paths Based on Monte Carlo Search Tree. In: Chen, X., Yan, H., Yan, Q., Zhang, X. (eds) Machine Learning for Cyber Security. ML4CS 2020. Lecture Notes in Computer Science(), vol 12488. Springer, Cham. https://doi.org/10.1007/978-3-030-62463-7_10
Download citation
DOI: https://doi.org/10.1007/978-3-030-62463-7_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-62462-0
Online ISBN: 978-3-030-62463-7
eBook Packages: Computer ScienceComputer Science (R0)