Paul Gastin

Sitert av

	Alle	Siden 2020
Sitater	4296	899
h-indeks	30	14
i10-indeks	80	19

260

130

195

1991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202523 26 30 23 27 18 35 30 25 53 34 69 78 98 142 133 150 160 177 178 200 201 221 237 244 207 172 179 162 156 207 181 169 153 33

Offentlig tilgang

Vis alle

10 artikler

0 artikler

tilgjengelige

ikke tilgjengelige

Basert på finansieringsmandater

Medforfattere

Antoine PetitEns de CachanVerifisert e-postadresse på ens-cachan.fr
Benedikt BolligCNRS, LMF, ENS Paris-Saclay, Université Paris-SaclayVerifisert e-postadresse på lsv.ens-cachan.fr
Manfred DrosteProfessor, Institut für Informatik, Universität LeipzigVerifisert e-postadresse på informatik.uni-leipzig.de
Narayan KumarProfessor, Chennai Mathematical InstituteVerifisert e-postadresse på cmi.ac.in
S AkshayIIT BombayVerifisert e-postadresse på cse.iitb.ac.in
Benjamin MonmegeAssistant Professor, Aix-Marseille Université, Laboratoire d'Informatique et SystèmesVerifisert e-postadresse på univ-amu.fr
Béatrice Bérardprofesseur émérite d'informatique, Sorbonne UniversitéVerifisert e-postadresse på lip6.fr
B SrivathsanChennai Mathematical Institute, Associate Professor of Computer ScienceVerifisert e-postadresse på cmi.ac.in
C. AiswaryaChennai Mathematical InstituteVerifisert e-postadresse på cmi.ac.in
Sayan MukherjeePostdoctoral fellow, DEVINE research group, INRIA RennesVerifisert e-postadresse på ulb.be
Michael MisloveTulane UniversityVerifisert e-postadresse på tulane.edu
Manfred KufleitnerUniversity of StuttgartVerifisert e-postadresse på fmi.uni-stuttgart.de
Vrunda DaveResearch Scholar, Indian Institute of Technology BombayVerifisert e-postadresse på cse.iitb.ac.in

Følg

Paul Gastin

Professor, LMF, ENS Paris-Saclay

Verifisert e-postadresse på lmf.cnrs.fr - Startside


Tittel Sorter etter sitater Sorter etter år Sorter etter tittel	Sitert av Sitert av	År
Fast LTL to Büchi automata translation P Gastin, D Oddoux Computer Aided Verification: 13th International Conference, CAV 2001 Paris …, 2001	1027	2001
Weighted automata and weighted logics M Droste, P Gastin Theoretical computer science 380 (1-2), 69-86, 2007	262	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	245	1998
First-order definable languages. V Diekert, P Gastin Logic and automata 2, 261-306, 2008	183	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	122	2008
Weighted automata and weighted logics M Droste, P Gastin International Colloquium on Automata, Languages, and Programming, 513-525, 2005	112	2005
Weighted automata and weighted logics M Droste, P Gastin Handbook of weighted automata, 175-211, 2009	82	2009
Minimization of counterexamples in SPIN P Gastin, P Moro, M Zeitoun International SPIN Workshop on Model Checking of Software, 92-108, 2004	81	2004
Infinite traces P Gastin LITP Spring School on Theoretical Computer Science, 277-308, 1990	74	1990
Asynchronous cellular automata for infinite traces P Gastin, A Petit Automata, Languages and Programming: 19th International Colloquium Wien …, 1992	66	1992
Removing ε-transitions in timed automata V Diekert, P Gastin, A Petit STACS 97: 14th Annual Symposium on Theoretical Aspects of Computer Science …, 1997	62	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	59	2003
MSO decidability of multi-pushdown systems via split-width A Cyriac, P Gastin, KN Kumar International Conference on Concurrency Theory, 547-561, 2012	57	2012
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	57	1996
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	54	2005
Pure future local temporal logics are expressively complete for Mazurkiewicz traces V Diekert, P Gastin Information and Computation 204 (11), 1597-1619, 2006	51	2006
Weighted versus probabilistic logics B Bollig, P Gastin International Conference on Developments in Language Theory, 18-38, 2009	50	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

Systemet kan ikke utføre handlingen. Prøv på nytt senere.

Artikler 1–20

Sitater per år

Duplikatsitater

Sammenslåtte sitater

Legg til medforfattereMedforfattere

Følg

Sitert av

Medforfattere