| No. |
Title |
Author |
Year |
| 1 |
On the Separability Problem of String Constraints |
Abdulla, Parosh Aziz et al. |
2020 |
| 2 |
Synthesis of Computable Regular Functions of Infinite Words |
Dave, Vrunda et al. |
2020 |
| 3 |
On Synthesis of Resynchronizers for Transducers |
Bose, Sougata et al. |
2019 |
| 4 |
Logics Meet 1-Clock Alternating Timed Automata |
Krishna, Shankara Narayanan et al. |
2018 |
| 5 |
Verification of Timed Asynchronous Programs |
Abdulla, Parosh Aziz et al. |
2018 |
| 6 |
Making Metric Temporal Logic Rational |
Krishna, Shankara Narayanan et al. |
2017 |
| 7 |
Towards an Efficient Tree Automata Based Technique for Timed Systems |
Akshay, S. et al. |
2017 |
| 8 |
Analyzing Timed Systems Using Tree Automata |
Akshay, S. et al. |
2016 |
| 9 |
FO-Definable Transformations of Infinite Strings |
Dave, Vrunda et al. |
2016 |
| 10 |
Mean-Payoff Games on Timed Automata |
Guha, Shibashis et al. |
2016 |
| 11 |
Stochastic Timed Games Revisited |
Akshay, S. et al. |
2016 |
| 12 |
Revisiting Robustness in Priced Timed Games |
Guha, Shibashis et al. |
2015 |
| 13 |
First-order Definable String Transformations |
Filiot, Emmanuel et al. |
2014 |
