| Fast LTL to Büchi automata translation P Gastin, D Oddoux Computer Aided Verification: 13th International Conference, CAV 2001 Paris …, 2001 | 1024 | 2001 |
| Weighted automata and weighted logics M Droste, P Gastin Theoretical computer science 380 (1-2), 69-86, 2007 | 259 | 2007 |
| Characterization of the expressive power of silent transitions in timed automata B Bérard, A Petit, V Diekert, P Gastin Fundamenta Informaticae 36 (2-3), 145-182, 1998 | 241 | 1998 |
| First-order definable languages. V Diekert, P Gastin Logic and automata 2, 261-306, 2008 | 181 | 2008 |
| A survey on small fragments of first-order logic over finite words V Diekert, P Gastin, M Kufleitner International Journal of Foundations of Computer Science 19 (03), 513-548, 2008 | 118 | 2008 |
| Weighted automata and weighted logics M Droste, P Gastin International Colloquium on Automata, Languages, and Programming, 513-525, 2005 | 108 | 2005 |
| Weighted automata and weighted logics M Droste, P Gastin Handbook of weighted automata, 175-211, 2009 | 81 | 2009 |
| Minimization of counterexamples in SPIN P Gastin, P Moro, M Zeitoun International SPIN Workshop on Model Checking of Software, 92-108, 2004 | 79 | 2004 |
| Infinite traces P Gastin LITP Spring School on Theoretical Computer Science, 277-308, 1990 | 72 | 1990 |
| Asynchronous cellular automata for infinite traces P Gastin, A Petit Automata, Languages and Programming: 19th International Colloquium Wien …, 1992 | 65 | 1992 |
| Removing ε-transitions in timed automata V Diekert, P Gastin, A Petit STACS 97: 14th Annual Symposium on Theoretical Aspects of Computer Science …, 1997 | 64 | 1997 |
| LTL with past and two-way very-weak alternating automata P Gastin, D Oddoux International Symposium on Mathematical Foundations of Computer Science, 439-448, 2003 | 58 | 2003 |
| On the power of non-observable actions in timed automata B Bérard, P Gastin, A Petit STACS 96: 13th Annual Symposium on Theoretical Aspects of Computer Science …, 1996 | 58 | 1996 |
| MSO decidability of multi-pushdown systems via split-width A Cyriac, P Gastin, KN Kumar International Conference on Concurrency Theory, 547-561, 2012 | 56 | 2012 |
| Distributed games with causal memory are decidable for series-parallel systems P Gastin, B Lerman, M Zeitoun FSTTCS 2004: Foundations of Software Technology and Theoretical Computer …, 2005 | 53 | 2005 |
| Pure future local temporal logics are expressively complete for Mazurkiewicz traces V Diekert, P Gastin Information and Computation 204 (11), 1597-1619, 2006 | 50 | 2006 |
| Weighted versus probabilistic logics B Bollig, P Gastin International Conference on Developments in Language Theory, 18-38, 2009 | 49 | 2009 |
| Asynchronous cellular automata for pomsets M Droste, P Gastin, D Kuske Theoretical Computer Science 247 (1-2), 1-38, 2000 | 47 | 2000 |
| Distributed timed automata with independently evolving clocks S Akshay, B Bollig, P Gastin, M Mukund, K Narayan Kumar International Conference on Concurrency Theory, 82-97, 2008 | 46 | 2008 |
| On aperiodic and star-free formal power series in partially commuting variables M Droste, P Gastin Theory of Computing Systems 42, 608-631, 2008 | 46 | 2008 |
Antoine PetitEns de CachanVerified email at ens-cachan.fr
