BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Estonia
1 × Hungary
1 × Switzerland
2 × Austria
2 × France
2 × Italy
2 × Portugal
3 × Germany
3 × Spain
Collaborated with:
V.Diekert B.Bollig B.Monmege A.Petit M.Droste M.Zeitoun M.Mukund D.Oddoux M.W.Mislove M.Kufleitner F.Derepas D.Plainfossé W.Zielonka S.M.0002 B.Srivathsan A.Cyriac K.N.Kumar
Talks about:
automata (7) weight (7) trace (7) logic (7) mazurkiewicz (4) languag (3) express (3) complet (3) pebbl (3) word (3)

Person: Paul Gastin

DBLP DBLP: Gastin:Paul

Contributed to:

CSL-LICS 20142014
FOSSACS 20132013
CIAA 20122012
FOSSACS 20122012
ICALP (2) 20102010
DLT 20092009
DLT 20072008
ICALP 20052005
ICALP 20022002
CAV 20012001
FME 20012001
ICALP 20002000
CSL 19991999
ICALP 19971997
DLT 19951995
ICALP 19951995
ICALP 19921992
ICALP 19911991
CAV (1) 20192019

Wrote 20 papers:

LICS-CSL-2014-BolligGMZ #automaton #logic
Logical characterization of weighted pebble walking automata (BB, PG, BM, MZ), p. 10.
FoSSaCS-2013-BolligGM #specification #word
Weighted Specifications over Nested Words (BB, PG, BM), pp. 385–400.
CIAA-2012-GastinM #automaton
Adding Pebbles to Weighted Automata (PG, BM), pp. 28–51.
FoSSaCS-2012-BolligCGK #model checking #word
Model Checking Languages of Data Words (BB, AC, PG, KNK), pp. 391–405.
ICALP-v2-2010-BolligGMZ #automaton #logic #transitive
Pebble Weighted Automata and Transitive Closure Logics (BB, PG, BM, MZ), pp. 587–598.
DLT-2009-BolligG #logic #probability
Weighted versus Probabilistic Logics (BB, PG), pp. 18–38.
DLT-J-2007-DiekertGK08 #finite #first-order #logic #overview #word
A Survey on Small Fragments of First-Order Logic over Finite Words (VD, PG, MK), pp. 513–548.
ICALP-2005-DrosteG #automaton #logic
Weighted Automata and Weighted Logics (MD, PG), pp. 513–525.
ICALP-2002-GastinM #logic
An Elementary Expressively Complete Temporal Logic for Mazurkiewicz Traces (PG, MM), pp. 938–949.
CAV-2001-GastinO #automaton #ltl #performance
Fast LTL to Büchi Automata Translation (PG, DO), pp. 53–65.
FME-2001-DerepasGP #distributed #explosion
Avoiding State Explosion for Distributed Systems with Timestamps (FD, PG, DP), pp. 119–134.
ICALP-2000-DiekertG #ltl
LTL Is Expressively Complete for Mazurkiewicz Traces (VD, PG), pp. 211–222.
CSL-1999-DiekertG #logic
An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz Traces (VD, PG), pp. 188–203.
CSL-1999-GastinM #concurrent #parallel #programming language #semantics
A Truly Concurrent Semantics for a Simple Parallel Programming Language (PG, MWM), pp. 515–529.
ICALP-1997-DrosteG #on the
On Recognizable and Rational Formal Power Series in Partially Commuting Variables (MD, PG), pp. 682–692.
DLT-1995-DiekertGP #traceability
Recent Developments in Trace Theory (VD, PG, AP), pp. 373–385.
ICALP-1995-DiekertG #concurrent #termination
A Domain for Concurrent Termination: A Generalization of Mazurkiewicz Traces (VD, PG), pp. 15–26.
ICALP-1992-GastinP #automaton #infinity
Asynchronous Cellular Automata for Infinite Traces (PG, AP), pp. 583–594.
ICALP-1991-GastinPZ #infinity #theorem
A Kleene Theorem for Infinite Trace Languages (PG, AP, WZ), pp. 254–266.
CAV-2019-Gastin0S #algorithm #automaton #constraints #performance
Fast Algorithms for Handling Diagonal Constraints in Timed Automata (PG, SM0, BS), pp. 41–59.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.