En cours

Séminaire algorithmique : Béatrice Bérard (LIP6, Sorbonne Univ.), « The reachability problem for Polynomial Interrupt Timed Automata»

Sciences 3- S3 351

Hybrid automata form an expressive model to describe systems combining continuous and discrete evolution modes. However, most verification problems are undecidable for this model. We recall the particular case of … Continue reading Séminaire algorithmique : Béatrice Bérard (LIP6, Sorbonne Univ.), « The reachability problem for Polynomial Interrupt Timed Automata»