Paul Gastin
Paul Gastin
Professor, LSV, ENS Paris-Saclay
Bestätigte E-Mail-Adresse bei - Startseite
Zitiert von
Zitiert von
Fast LTL to Büchi automata translation
P Gastin, D Oddoux
Computer Aided Verification: 13th International Conference, CAV 2001 Paris …, 2001
Weighted automata and weighted logics
M Droste, P Gastin
Handbook of weighted automata, 175-211, 2009
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
First-order definable languages.
V Diekert, P Gastin
Logic and automata 2, 261-306, 2008
Weighted automata and weighted logics
M Droste, P Gastin
Automata, Languages and Programming: 32nd International Colloquium, ICALP …, 2005
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
Minimization of counterexamples in SPIN
P Gastin, P Moro, M Zeitoun
Model Checking Software: 11th International SPIN Workshop, Barcelona, Spain …, 2004
Infinite traces
P Gastin
Semantics of Systems of Concurrent Processes: LITP Spring School on …, 2005
Asynchronous Cellular Automata for Infinite Traces.
P Gastin, A Petit
ICALP 92, 583-594, 1992
Removing ε-transitions in timed automata
V Diekert, P Gastin, A Petit
STACS 97: 14th Annual Symposium on Theoretical Aspects of Computer Science …, 1997
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
LTL with past and two-way very-weak alternating automata
P Gastin, D Oddoux
Mathematical Foundations of Computer Science 2003: 28th International …, 2003
MSO decidability of multi-pushdown systems via split-width
A Cyriac, P Gastin, KN Kumar
CONCUR 2012–Concurrency Theory: 23rd International Conference, CONCUR 2012 …, 2012
Pure future local temporal logics are expressively complete for Mazurkiewicz traces
V Diekert, P Gastin
Information and Computation 204 (11), 1597-1619, 2006
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
Weighted versus probabilistic logics
B Bollig, P Gastin
Developments in Language Theory: 13th International Conference, DLT 2009 …, 2009
Satisfiability and model checking for MSO-definable temporal logics are in PSPACE
P Gastin, D Kuske
CONCUR 2003-Concurrency Theory: 14th International Conference, Marseille …, 2003
Asynchronous cellular automata for pomsets
M Droste, P Gastin, D Kuske
Theoretical Computer Science 247 (1-2), 1-38, 2000
Distributed timed automata with independently evolving clocks
S Akshay, B Bollig, P Gastin, M Mukund, K Narayan Kumar
CONCUR 2008-Concurrency Theory: 19th International Conference, CONCUR 2008 …, 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
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20