2:00 pm,Lecture Hall 801(8th Floor) Verification of Hybrid Systems Béatrice Bérard Sorbonne Université - LIP6 France. 16-12-19 Abstract For Hybrid systems that combine discrete and continuous components, verification is a notoriously difficult task. I will give several decidability results involving various techniques, starting with the well known model of Timed Automata and extending the quotient construction to Polynomial Interrupt Timed Automata. In the last part, I will show some conditions to obtain a bisimulation for o-minimal dynamical systems where trajectories can overlap.
|