Rights accessRestricted access - publisher's policy
This paper presents the schedulability analysis for control messages when networked control loops, built on top of the controller area network (CAN), are dynamically allocating bandwidth in terms of their controlled plants' dynamics. The bandwidth allocation policy is theoretically described by an optimization problem and practically solved by the distributed bitwise arbitration of CAN messages when message identifiers, i.e., priorities, reflect control applications demands. This poses the problem of assessing whether the set of real-time messages will meet their deadlines regardless of run-time priority changes. This is solved by a schedulability analysis based on recent results on worst-case response time techniques for real-time CAN applications. The analysis ends up with the schedulability test for this type of applications.
CitationVelasco, M. [et al.]. Schedulability Analysis for CAN-based Networked Control Systems with Dynamic Bandwidth Management. A: IEEE International Conference on Emerging Technologies and Factory Automation. "14th IEEE International Conference on Emerging Technologies and Factory Automation". 2009, p. 1-8.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: firstname.lastname@example.org