Where and when? | What? | Who? |
---|---|---|

Lecture Hall 5 9 September, 2019 5.00 pm |
In this talk, we will look into the model of Timed Automata,
the problem of reachability and how we can check reachability in Timed
Automata. After this, we will see what are diagonal constraints, how
they are useful and why the off-the-shelf reachability algorithms cannot
be used when diagonal constraints are present in the automaton. If time
permits, we will discuss a few possible ways of dealing with diagonal
constraints. |
Sayan Mukherjee |

Lecture Hall 5 2 July, 2019 4.00 pm |
We need a 'reset' button when systems go crazy. I'll talk about how do we do that automata theoretically. No background is assumed apart from basic automata theory and graph theory. |
Adwitee Roy |

Lecture Hall 5 18 June, 2019 4.00 pm |
I will introduce Arithmetic Circuits and the various problems that arise in this subject. Then we shall move to the non-commutative setting and illustrate how automata theory can be used to address some of these problems. |
Rajit Datta |

Lecture Hall 5 14 June, 2019 4.00 pm |
The setting for the problem is as follows - |
R Keerthan |