Paul Gastin

Navedeno

	Vse	Od leta 2020
Navedbe	4238	894
indeks h	30	14
indeks i10	79	21

260

130

195

1991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520 27 30 23 27 18 35 31 26 51 33 68 74 97 143 131 137 159 172 178 199 197 218 227 243 203 173 184 158 158 208 186 168 156 18

Javni dostop

Prikaži vse

9 člankov

0 člankov

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

Antoine PetitEns de CachanPreverjeni e-poštni naslov na ens-cachan.fr
Benedikt BolligCNRS, LMF, ENS Paris-Saclay, Université Paris-SaclayPreverjeni e-poštni naslov na lsv.ens-cachan.fr
Manfred DrosteProfessor, Institut für Informatik, Universität LeipzigPreverjeni e-poštni naslov na informatik.uni-leipzig.de
Narayan KumarProfessor, Chennai Mathematical InstitutePreverjeni e-poštni naslov na cmi.ac.in
S AkshayIIT BombayPreverjeni e-poštni naslov na cse.iitb.ac.in
Benjamin MonmegeAssistant Professor, Aix-Marseille Université, Laboratoire d'Informatique et SystèmesPreverjeni e-poštni naslov na univ-amu.fr
Béatrice Bérardprofesseur émérite d'informatique, Sorbonne UniversitéPreverjeni e-poštni naslov na lip6.fr
B SrivathsanChennai Mathematical Institute, Associate Professor of Computer SciencePreverjeni e-poštni naslov na cmi.ac.in
C. AiswaryaChennai Mathematical InstitutePreverjeni e-poštni naslov na cmi.ac.in
Sayan MukherjeePostdoctoral fellow, Université Libre de BruxellesPreverjeni e-poštni naslov na ulb.be
Michael MisloveTulane UniversityPreverjeni e-poštni naslov na tulane.edu
Manfred KufleitnerUniversity of StuttgartPreverjeni e-poštni naslov na fmi.uni-stuttgart.de
Vrunda DaveResearch Scholar, Indian Institute of Technology BombayPreverjeni e-poštni naslov na cse.iitb.ac.in

Spremljaj

Paul Gastin

Professor, LMF, ENS Paris-Saclay

Preverjeni e-poštni naslov na lmf.cnrs.fr - Domača stran


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
Fast LTL to Büchi automata translation P Gastin, D Oddoux Computer Aided Verification: 13th International Conference, CAV 2001 Paris …, 2001	1026	2001
Weighted automata and weighted logics M Droste, P Gastin Theoretical computer science 380 (1-2), 69-86, 2007	261	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	82	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	55	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

Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.

Članki 1–20

Št. navedb na leto

Podvojene navedbe

Združene navedbe

Dodajanje soavtorjevSoavtorji

Spremljaj

Navedeno

Soavtorji