Abstract
In this chapter, we consider decision trees for diagnosis of constant faults in switching networks. We study the depth of diagnostic decision trees for arbitrary and specially constructed switching networks and the complexity of diagnostic decision tree construction. We also investigate the depth of diagnostic decision trees for iteration-free networks over finite bases containing only indecomposable nontrivial networks and find the minimum depth of diagnostic decision trees for all indecomposable nontrivial networks with at most 10 edges.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
AbouEisha, H., Amin, T., Chikalov, I., Hussain, S., Moshkov, M.: Extensions of dynamic programming for combinatorial optimization and data mining. In: Intelligent Systems Reference Library, vol. 146. Springer (2019)
Alkhalid, A., Amin, T., Chikalov, I., Hussain, S., Moshkov, M., Zielosko, B.: Optimization and analysis of decision trees and rules: dynamic programming approach. Int. J. Gen. Syst. 42(6), 614–634 (2013)
Alkhalid, A., Chikalov, I., Moshkov, M.: Comparison of greedy algorithms for decision tree optimization. In:  Skowron, A., Suraj, Z. (eds.), Rough Sets and Intelligent Systems - Professor Zdzisław Pawlak in Memoriam - Volume 2. Intelligent Systems Reference Library, vol. 43, pp. 21–40. Springer (2013)
Busbait, M., Chikalov, I., Hussain, S., Moshkov, M.: Diagnosis of constant faults in read-once contact networks over finite bases. Discret. Appl. Math. 184, 76–88 (2015)
Busbait, M., Moshkov, M.: Diagnosis of three types of constant faults in read-once contact networks over finite bases. Theor. Comput. Sci. 630, 26–42 (2016)
Garey, M.R.: Optimal binary identification procedures. SIAM J. Appl. Math. 23(2), 173–186 (1972)
Goduhina, G.B.: Experimental study of conditional tests for diagnosis of constant faults in iteration-free contact networks. In: Combinatorial-Algebraic and Probabilistic Methods in Applied Mathematics, pp. 16–21. Gorky University Publishers, Gorky (1988). (in Russian)
Kuznetsov, A.V.: Non-repeating contact schemes and non-repeating superpositions of functions of algebra of logic. Trudy MIAN SSSR 51, 186–225 (1958). (in Russian)
Madatyan, K.A.: Complete test for repetition-free contact circuits. In: Probl. Kibern., vol. 23, pp. 103–118. Nauka Publishers, Moscow (1970). (in Russian)
Moshkov, M.: Time complexity of decision trees. In: Peters, J.F., Skowron, A. (eds.), Trans. Rough Sets III. Lecture Notes in Computer Science, vol. 3400, pp. 244–459. Springer (2005)
Moshkov, M.: Diagnosis of constant faults in switching networks. arXiv:2302.02756 [cs.CC] (2023)
Moshkov, M., Chikalov, I.: On algorithm for constructing of decision trees with minimal depth. Fund. Inf. 41(3), 295–299 (2000)
Quinlan, J.R.: Induction of decision trees. Mach. Learn. 1(1), 81–106 (1986)
Shannon, C.E.: A symbolic analysis of relay and switching circuits. Trans. Am. Inst. Electr. Eng. 57(12), 713–723 (1938)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Busbait, M., Moshkov, M., Moshkova, A., Shevtchenko, V. (2023). Diagnosis of Constant Faults in Switching Networks. In: Decision Trees for Fault Diagnosis in Circuits and Switching Networks. Studies in Systems, Decision and Control, vol 493. Springer, Cham. https://doi.org/10.1007/978-3-031-39031-9_6
Download citation
DOI: https://doi.org/10.1007/978-3-031-39031-9_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-39030-2
Online ISBN: 978-3-031-39031-9
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)