Decidable and Undecidable Problems in Schedulability Analysis Using Timed Automata

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-24730-2_20
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg