Cerqueira, FelipeBrandenburg, Björn B.Nelissen, Geoffrey2018-12-2020180922-6443http://hdl.handle.net/10400.22/12447In this correspondence letter, we document and correct a flaw in the reduction-based analysis for real-time scheduling with arbitrary processor affinities (APA). To provide further confidence, the corrected claims have been formalized and machine-checked using the Coq proof assistant.engCorrespondence article: a correction of the reduction-based schedulability analysis for APA schedulingjournal article10.1007/s11241-018-9315-x