Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
This lecture covers the application of time-determinator and time-determinator model checking for schedule ability analysis, as well as the translation of scheduling problems into U-Pool. It also delves into the use of U-Pool for scheduling under OSIC, modular schedulability within CREOL, and schedulability analysis for JABYBike code. The discussion extends to worst-case execution time analysis using time-to-tomato components, with examples from ARM platforms. The lecture further explores statistical model checking in UPAL-SMC, focusing on stochastic hybrid automata and cyber-physical systems modeling, emphasizing trustworthiness and probabilistic behavior analysis.