Discrete-event systems (fault tolerance and detection, hierarchical structure, concurrency and implementation), formal verification of hardware and software
1. Scheduling a. Time-based scheduling b. Classical results for single processor scheduling algorithms c. Multiprocessor scheduling d. Scheduling with energy concerns The rest of the course coverage will be filled in after a vote of the class. The following are all possibilities. 2. Real-Time Operating Systems – we can look at TinyOS, details of its implementation and some applications. 3. Fault Tolerance Techniques 4. State-Space Control Theory and Real-Time Implementation 5. Specification of Real-Time Systems (examine in detail one framework – UML, Timed Petri Nets, etc.) 6. Individual Student Presentations – allows you to explore and present a topic of your choice.
