Verification of Two Real-Time Systems Using Parametric Timed Automata
Résumé
In this paper we propose solutions to the FMTV challenge of a distributed video processing system using the formalism of Parametric Timed Automata (PTA). The first challenge is harder because of the very large number of states to be analysed, so we only provide upper bounds. The second challenge consists of a real-time scheduling problem for which we provide exact solutions by using a scheduling analysis based on the critical instant, and a PTA model.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...