Automata-theoretic modeling of fixed-priority non-preemptive scheduling for formal timing verification | IEEE Conference Publication | IEEE Xplore