Abstract
The paper deals with qualitative analysis of the so-called switched fluid networks. Such networks are used to model communication, computer, and flexible manufacturing systems. We prove that for any deterministic network from a certain specific class, there exists a finite number of limit cycles attracting all trajectories. Furthermore, we determine this number.
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 callDisclaimer: 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.
