No. Title Author Year
1 Quantifying Bounds in Strategy Logic Fijalkow, NathanaŽl et al. 2018
2 Expressiveness of Probabilistic Modal Logics, Revisited Fijalkow, NathanaŽl et al. 2017
3 Probabilistic Automata of Bounded Ambiguity Fijalkow, NathanaŽl et al. 2017
4 Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem Fijalkow, NathanaŽl et al. 2017
5 Characterisation of an Algebraic Algorithm for Probabilistic Automata Fijalkow, NathanaŽl 2016
6 The Bridge Between Regular Cost Functions and Omega-Regular Languages Colcombet, Thomas et al. 2016
7 Playing Safe Colcombet, Thomas et al. 2014
8 Emptiness Of Alternating Tree Automata Using Games With Imperfect Information Fijalkow, NathanaŽl et al. 2013
9 Infinite-state games with finitary conditions Chatterjee, Krishnendu et al. 2013
10 Cost-Parity and Cost-Streett Games Fijalkow, Nathanael et al. 2012
Current Page :
Number of result pages: 1
Number of documents: 10


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI