No. |
Title |
Author |
Year |
---|

1 |
A Robust Class of Linear Recurrence Sequences |
Barloy, Corentin et al. |
2020 |

2 |
Quantifying Bounds in Strategy Logic |
Fijalkow, Nathanaël et al. |
2018 |

3 |
Expressiveness of Probabilistic Modal Logics, Revisited |
Fijalkow, Nathanaël et al. |
2017 |

4 |
Probabilistic Automata of Bounded Ambiguity |
Fijalkow, Nathanaël et al. |
2017 |

5 |
Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem |
Fijalkow, Nathanaël et al. |
2017 |

6 |
Characterisation of an Algebraic Algorithm for Probabilistic Automata |
Fijalkow, Nathanaël |
2016 |

7 |
The Bridge Between Regular Cost Functions and Omega-Regular Languages |
Colcombet, Thomas et al. |
2016 |

8 |
Playing Safe |
Colcombet, Thomas et al. |
2014 |

9 |
Emptiness Of Alternating Tree Automata Using Games With Imperfect Information |
Fijalkow, Nathanaël et al. |
2013 |

10 |
Infinite-state games with finitary conditions |
Chatterjee, Krishnendu et al. |
2013 |

11 |
Cost-Parity and Cost-Streett Games |
Fijalkow, Nathanael et al. |
2012 |