Abstract
The concept of switching automaton is introduced as a mathematical model for switching control in electric networks. The concepts of a system of switching rules and a switching problem are formalized. The general solutions to switching problems are investigated with the help of switching diagrams. The relation of switching diagrams and distributive lattices is established. A system of algebraic operations over switchings is defined. A general method of hierarchical decomposition of switching diagrams is presented.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Computer and Systems Sciences International
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
