Spremljaj
Paul Gastin
Paul Gastin
Professor, LMF, ENS Paris-Saclay
Preverjeni e-poštni naslov na lmf.cnrs.fr - Domača stran
Naslov
Navedeno
Navedeno
Leto
Fast LTL to Büchi automata translation
P Gastin, D Oddoux
Computer Aided Verification: 13th International Conference, CAV 2001 Paris …, 2001
10002001
Weighted automata and weighted logics
M Droste, P Gastin
Handbook of weighted automata, 175-211, 2009
2852009
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
2381998
First-order definable languages.
V Diekert, P Gastin
Logic and automata 2, 261-306, 2008
1762008
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
1162008
Weighted automata and weighted logics
M Droste, P Gastin
International Colloquium on Automata, Languages, and Programming, 513-525, 2005
1062005
Minimization of counterexamples in SPIN
P Gastin, P Moro, M Zeitoun
International SPIN Workshop on Model Checking of Software, 92-108, 2004
792004
Infinite traces
P Gastin
LITP Spring School on Theoretical Computer Science, 277-308, 1990
711990
Asynchronous cellular automata for infinite traces
P Gastin, A Petit
Automata, Languages and Programming: 19th International Colloquium Wien …, 1992
651992
Removing ε-transitions in timed automata
V Diekert, P Gastin, A Petit
STACS 97: 14th Annual Symposium on Theoretical Aspects of Computer Science …, 1997
631997
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
562003
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
561996
MSO decidability of multi-pushdown systems via split-width
A Cyriac, P Gastin, KN Kumar
International Conference on Concurrency Theory, 547-561, 2012
542012
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
512005
Weighted versus probabilistic logics
B Bollig, P Gastin
International Conference on Developments in Language Theory, 18-38, 2009
492009
Pure future local temporal logics are expressively complete for Mazurkiewicz traces
V Diekert, P Gastin
Information and Computation 204 (11), 1597-1619, 2006
492006
Asynchronous cellular automata for pomsets
M Droste, P Gastin, D Kuske
Theoretical Computer Science 247 (1-2), 1-38, 2000
472000
On aperiodic and star-free formal power series in partially commuting variables
M Droste, P Gastin
Theory of Computing Systems 42, 608-631, 2008
452008
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
442003
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
432008
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–20