The LSV seminar takes place on Tuesday at 11:00 AM. The usual location is the conference room at Pavillon des Jardins (venue). If you wish to be informed by e-mail about upcoming seminars, please contact Stéphane Le Roux and Matthias Fuegger.
The seminar is open to public and does not require any form of registration.
In this talk, we will show that if P is not equal to NP, the liveness problem for timed automata is more difficult than the reachability problem. We will then present a new algorithm to solve the liveness problem for timed automata, and compare it with existing solutions.
Joint work with F. Herbreteau, T.T Tran and I. Walukiewicz.