Automata-theoretic modeling of fixed-priority non-preemptive scheduling for formal timing verification

Matthias Kauer, Sebastian Steinhorst, Reinhard Schneider 0001, Martin Lukasiewycz, Samarjit Chakraborty. Automata-theoretic modeling of fixed-priority non-preemptive scheduling for formal timing verification. In 19th Asia and South Pacific Design Automation Conference, ASP-DAC 2014, Singapore, January 20-23, 2014. pages 812-817, IEEE, 2014. [doi]

Abstract

Abstract is missing.