Fersman, E., Mokrushin, L., Pettersson, P., & Yi, W. (2006). Schedulability analysis of fixed-priority systems using timed automata. Theoretical computer science, 354(2), 301-317. https://doi.org/10.1016/j.tcs.2005.11.019
Chicago Style (17th ed.) CitationFersman, Elena, Leonid Mokrushin, Paul Pettersson, and Wang Yi. "Schedulability Analysis of Fixed-priority Systems Using Timed Automata." Theoretical Computer Science 354, no. 2 (2006): 301-317. https://doi.org/10.1016/j.tcs.2005.11.019.
MLA (9th ed.) CitationFersman, Elena, et al. "Schedulability Analysis of Fixed-priority Systems Using Timed Automata." Theoretical Computer Science, vol. 354, no. 2, 2006, pp. 301-317, https://doi.org/10.1016/j.tcs.2005.11.019.
Warning: These citations may not always be 100% accurate.