Paul Gastin
Paul Gastin
Professor, LSV, ENS Paris-Saclay
Bestätigte E-Mail-Adresse bei lsv.fr - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Fast LTL to Büchi automata translation
P Gastin, D Oddoux
International Conference on Computer Aided Verification, 53-65, 2001
8822001
Weighted automata and weighted logics
M Droste, P Gastin
Handbook of weighted automata, 175-211, 2009
2592009
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
2201998
First-order definable languages.
V Diekert, P Gastin
Logic and automata 2, 261-306, 2008
1502008
Weighted automata and weighted logics
M Droste, P Gastin
International Colloquium on Automata, Languages, and Programming, 513-525, 2005
962005
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
922008
Minimization of counterexamples in SPIN
P Gastin, P Moro, M Zeitoun
International SPIN Workshop on Model Checking of Software, 92-108, 2004
692004
Asynchronous cellular automata for infinite traces
P Gastin, A Petit
International Colloquium on Automata, Languages, and Programming, 583-594, 1992
631992
Infinite traces
P Gastin
LITP Spring School on Theoretical Computer Science, 277-308, 1990
631990
Removing ε-transitions in timed automata
V Diekert, P Gastin, A Petit
Annual Symposium on Theoretical Aspects of Computer Science, 583-594, 1997
571997
On the power of non-observable actions in timed automata
B Bérard, P Gastin, A Petit
Annual Symposium on Theoretical Aspects of Computer Science, 255-268, 1996
551996
MSO decidability of multi-pushdown systems via split-width
A Cyriac, P Gastin, KN Kumar
International Conference on Concurrency Theory, 547-561, 2012
532012
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
522003
Pure future local temporal logics are expressively complete for Mazurkiewicz traces
V Diekert, P Gastin
Information and Computation 204 (11), 1597-1619, 2006
502006
Weighted versus probabilistic logics
B Bollig, P Gastin
International Conference on Developments in Language Theory, 18-38, 2009
482009
Satisfiability and model checking for MSO-definable temporal logics are in PSPACE
P Gastin, D Kuske
International Conference on Concurrency Theory, 222-236, 2003
462003
Distributed games with causal memory are decidable for series-parallel systems
P Gastin, B Lerman, M Zeitoun
International Conference on Foundations of Software Technology and …, 2004
452004
Distributed timed automata with independently evolving clocks
S Akshay, B Bollig, P Gastin, M Mukund, KN Kumar
International Conference on Concurrency Theory, 82-97, 2008
402008
On aperiodic and star-free formal power series in partially commuting variables
M Droste, P Gastin
Theory of Computing Systems 42 (4), 608-631, 2008
392008
Asynchronous cellular automata for pomsets
M Droste, P Gastin, D Kuske
Theoretical Computer Science 247 (1-2), 1-38, 2000
392000
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20