A Conservative Approximation Method for the Verification of Preemptive Scheduling Using Timed Automata

Gabor Madl, Nikil Dutt, Sherif Abdelwahed. A Conservative Approximation Method for the Verification of Preemptive Scheduling Using Timed Automata. In 15th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2009, San Francisco, CA, USA, 13-16 April 2009. pages 255-264, IEEE Computer Society, 2009. [doi]

@inproceedings{MadlDA09,
  title = {A Conservative Approximation Method for the Verification of Preemptive Scheduling Using Timed Automata},
  author = {Gabor Madl and Nikil Dutt and Sherif Abdelwahed},
  year = {2009},
  doi = {10.1109/RTAS.2009.32},
  url = {http://doi.ieeecomputersociety.org/10.1109/RTAS.2009.32},
  researchr = {https://researchr.org/publication/MadlDA09},
  cites = {0},
  citedby = {0},
  pages = {255-264},
  booktitle = {15th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2009, San Francisco, CA, USA, 13-16 April 2009},
  publisher = {IEEE Computer Society},
  isbn = {978-0-7695-3636-1},
}