| 2009 |
|---|
| 65 | EE | Thomas Chatain,
Paul Gastin,
Nathalie Sznajder:
Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems.
SOFSEM 2009: 141-152 |
| 2008 |
|---|
| 64 | EE | S. Akshay,
Benedikt Bollig,
Paul Gastin,
Madhavan Mukund,
K. Narayan Kumar:
Distributed Timed Automata with Independently Evolving Clocks.
CONCUR 2008: 82-97 |
| 63 | EE | Volker Diekert,
Paul Gastin,
Manfred Kufleitner:
A Survey on Small Fragments of First-Order Logic over Finite Words.
Int. J. Found. Comput. Sci. 19(3): 513-548 (2008) |
| 62 | EE | Manfred Droste,
Paul Gastin:
On Aperiodic and Star-Free Formal Power Series in Partially Commuting Variables.
Theory Comput. Syst. 42(4): 608-631 (2008) |
| 2007 |
|---|
| 61 | EE | Puneet Bhateja,
Paul Gastin,
Madhavan Mukund,
K. Narayan Kumar:
Local Testing of Message Sequence Charts Is Difficult.
FCT 2007: 76-87 |
| 60 | EE | S. Akshay,
Benedikt Bollig,
Paul Gastin:
Automata and Logics for Timed Message Sequence Charts.
FSTTCS 2007: 290-302 |
| 59 | EE | Paul Gastin,
Pierre Moro:
Minimal Counterexample Generation for SPIN.
SPIN 2007: 24-38 |
| 58 | EE | Béatrice Bérard,
Paul Gastin,
Antoine Petit:
Timed substitutions for regular signal-event languages.
Formal Methods in System Design 31(2): 101-134 (2007) |
| 57 | EE | Paul Gastin,
Dietrich Kuske:
Uniform Satisfiability in PSPACE for Local Temporal Logics Over Mazurkiewicz Traces.
Fundam. Inform. 80(1-3): 169-197 (2007) |
| 56 | EE | Manfred Droste,
Paul Gastin:
Weighted automata and weighted logics.
Theor. Comput. Sci. 380(1-2): 69-86 (2007) |
| 2006 |
|---|
| 55 | EE | Puneet Bhateja,
Paul Gastin,
Madhavan Mukund:
A Fresh Look at Testing for Asynchronous Communication.
ATVA 2006: 369-383 |
| 54 | EE | Béatrice Bérard,
Paul Gastin,
Antoine Petit:
Intersection of Regular Signal-Event (Timed) Languages.
FORMATS 2006: 52-66 |
| 53 | EE | Béatrice Bérard,
Paul Gastin,
Antoine Petit:
Refinements and Abstractions of Signal-Event (Timed) Languages.
FORMATS 2006: 67-81 |
| 52 | EE | Paul Gastin,
Nathalie Sznajder,
Marc Zeitoun:
Distributed Synthesis for Well-Connected Architectures.
FSTTCS 2006: 321-332 |
| 51 | EE | Volker Diekert,
Paul Gastin:
Pure future local temporal logics are expressively complete for Mazurkiewicz traces.
Inf. Comput. 204(11): 1597-1619 (2006) |
| 50 | EE | Volker Diekert,
Paul Gastin:
From local to global temporal logics over Mazurkiewicz traces.
Theor. Comput. Sci. 356(1-2): 126-135 (2006) |
| 2005 |
|---|
| 49 | EE | Paul Gastin,
Dietrich Kuske:
Uniform Satisfiability Problem for Local Temporal Logics over Mazurkiewicz Traces.
CONCUR 2005: 533-547 |
| 48 | EE | Manfred Droste,
Paul Gastin:
Weighted Automata and Weighted Logics.
ICALP 2005: 513-525 |
| 2004 |
|---|
| 47 | EE | Paul Gastin,
Benjamin Lerman,
Marc Zeitoun:
Distributed Games with Causal Memory Are Decidable for Series-Parallel Systems.
FSTTCS 2004: 275-286 |
| 46 | EE | Volker Diekert,
Paul Gastin:
Pure Future Local Temporal Logics Are Expressively Complete for Mazurkiewicz Traces.
LATIN 2004: 232-241 |
| 45 | EE | Paul Gastin,
Benjamin Lerman,
Marc Zeitoun:
Distributed Games and Distributed Control for Asynchronous Systems.
LATIN 2004: 455-465 |
| 44 | EE | Paul Gastin,
Pierre Moro,
Marc Zeitoun:
Minimization of Counterexamples in SPIN.
SPIN 2004: 92-108 |
| 43 | EE | Volker Diekert,
Paul Gastin:
Local temporal logic is expressively complete for cograph dependence alphabets.
Inf. Comput. 195(1-2): 30-52 (2004) |
| 42 | EE | Paul Gastin,
Michael W. Mislove:
A simple process algebra based on atomic actions with resources.
Mathematical Structures in Computer Science 14(1): 1-55 (2004) |
| 2003 |
|---|
| 41 | EE | Paul Gastin,
Dietrich Kuske:
Satisfiability and Model Checking for MSO-definable Temporal Logics are in PSPACE.
CONCUR 2003: 218-232 |
| 40 | EE | Paul Gastin,
Madhavan Mukund,
K. Narayan Kumar:
Local LTL with Past Constants Is Expressively Complete for Mazurkiewicz Traces.
MFCS 2003: 429-438 |
| 39 | EE | Paul Gastin,
Denis Oddoux:
LTL with Past and Two-Way Very-Weak Alternating Automata.
MFCS 2003: 439-448 |
| 2002 |
|---|
| 38 | EE | Volker Diekert,
Paul Gastin:
Safety and Liveness Properties for Real Traces and a Direct Translation from LTL to Monoids.
Formal and Natural Computing 2002: 26-38 |
| 37 | EE | Paul Gastin,
Madhavan Mukund:
An Elementary Expressively Complete Temporal Logic for Mazurkiewicz Traces.
ICALP 2002: 938-949 |
| 36 | EE | Volker Diekert,
Paul Gastin:
LTL Is Expressively Complete for Mazurkiewicz Traces.
J. Comput. Syst. Sci. 64(2): 396-418 (2002) |
| 35 | EE | Paul Gastin,
Dan Teodosiu:
Resource traces: a domain for processes sharing exclusive resources.
Theor. Comput. Sci. 278(1-2): 195-221 (2002) |
| 34 | EE | Paul Gastin,
Michael W. Mislove:
A truly concurrent semantics for a process algebra using resource pomsets.
Theor. Comput. Sci. 281(1-2): 369-421 (2002) |
| 2001 |
|---|
| 33 | EE | Paul Gastin,
Denis Oddoux:
Fast LTL to Büchi Automata Translation.
CAV 2001: 53-65 |
| 32 | EE | Fabrice Derepas,
Paul Gastin,
David Plainfossé:
Avoiding State Explosion for Distributed Systems with Timestamps.
FME 2001: 119-134 |
| 31 | EE | Volker Diekert,
Paul Gastin:
Local Temporal Logic is Expressively Complete for Cograph Dependence Alphabets.
LPAR 2001: 55-69 |
| 30 | EE | Fabrice Derepas,
Paul Gastin:
Model Checking Systems of Replicated Processes with Spin.
SPIN 2001: 235-251 |
| 2000 |
|---|
| 29 | EE | Volker Diekert,
Paul Gastin:
LTL Is Expressively Complete for Mazurkiewicz Traces.
ICALP 2000: 211-222 |
| 28 | EE | Manfred Droste,
Paul Gastin,
Dietrich Kuske:
Asynchronous cellular automata for pomsets.
Theor. Comput. Sci. 247(1-2): 1-38 (2000) |
| 1999 |
|---|
| 27 | | Volker Diekert,
Paul Gastin:
An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz Traces.
CSL 1999: 188-203 |
| 26 | | Paul Gastin,
Michael W. Mislove:
A Truly Concurrent Semantics for a Simple Parallel Programming Language.
CSL 1999: 515-529 |
| 25 | | Manfred Droste,
Paul Gastin:
The Kleene-Schützenberger Theorem for Formal Power Series in Partially Commuting Variables.
Inf. Comput. 153(1): 47-80 (1999) |
| 1998 |
|---|
| 24 | EE | Paul Gastin,
Raphaël Meyer,
Antoine Petit:
A (Non-elementary) Modular Decision Procedure for LTrL.
MFCS 1998: 356-365 |
| 23 | EE | Volker Diekert,
Paul Gastin:
Approximating Traces.
Acta Inf. 35(7): 567-593 (1998) |
| 22 | | Béatrice Bérard,
Antoine Petit,
Volker Diekert,
Paul Gastin:
Characterization of the Expressive Power of Silent Transitions in Timed Automata.
Fundam. Inform. 36(2-3): 145-182 (1998) |
| 1997 |
|---|
| 21 | | Manfred Droste,
Paul Gastin:
On Recognizable and Rational Formal Power Series in Partially Commuting Variables.
ICALP 1997: 682-692 |
| 20 | | Volker Diekert,
Paul Gastin,
Antoine Petit:
Removing epsilon-Transitions in Timed Automata.
STACS 1997: 583-594 |
| 1996 |
|---|
| 19 | | Manfred Droste,
Paul Gastin:
Asynchronous Cellular Automata for Pomsets Without Auto-concurrency.
CONCUR 1996: 627-638 |
| 18 | | Béatrice Bérard,
Paul Gastin,
Antoine Petit:
On the Power of Non-Observable Actions in Timed Automata.
STACS 1996: 257-268 |
| 1995 |
|---|
| 17 | | Volker Diekert,
Paul Gastin,
Antoine Petit:
Recent Developments in Trace Theory.
Developments in Language Theory 1995: 373-385 |
| 16 | | Volker Diekert,
Paul Gastin:
A Domain for Concurrent Termination: A Generalization of Mazurkiewicz Traces (Extended Abstract).
ICALP 1995: 15-26 |
| 15 | | Serge Bauget,
Paul Gastin:
On Congruences and Partial Orders.
MFCS 1995: 434-443 |
| 14 | | Volker Diekert,
Paul Gastin,
Antoine Petit:
Rational and Recognizable Complex Trace Languages
Inf. Comput. 116(1): 134-153 (1995) |
| 1994 |
|---|
| 13 | | Paul Gastin,
Antoine Petit,
Wieslaw Zielonka:
An Extension of Kleene's and Ochmanski's Theorems to Infinite Traces.
Theor. Comput. Sci. 125(2): 167-204 (1994) |
| 1993 |
|---|
| 12 | | Paul Gastin,
Vincent Villain:
An Efficient Crash-tolerant Sequential Traversal.
Parallel Processing Letters 3: 87-97 (1993) |
| 11 | | Paul Gastin,
Brigitte Rozoy:
The Poset of Infinitary Traces.
Theor. Comput. Sci. 120(1): 101-121 (1993) |
| 1992 |
|---|
| 10 | | Paul Gastin,
Antoine Petit:
A survey of recognizable languages with infinite traces.
Advances in Petri Nets: The DEMON Project 1992: 392-409 |
| 9 | | Paul Gastin,
Antoine Petit:
Asynchronous Cellular Automata for Infinite Traces.
ICALP 1992: 583-594 |
| 8 | | Paul Gastin,
Antoine Petit:
Poset Properties of Complex Traces.
MFCS 1992: 255-263 |
| 7 | | Paul Gastin,
Edward Ochmanski,
Antoine Petit,
Brigitte Rozoy:
Decidability of the Star Problem in A* x {b}*.
Inf. Process. Lett. 44(2): 65-71 (1992) |
| 1991 |
|---|
| 6 | | Paul Gastin,
Antoine Petit,
Wieslaw Zielonka:
A Kleene Theorem for Infinite Trace Languages.
ICALP 1991: 254-266 |
| 5 | | Volker Diekert,
Paul Gastin,
Antoine Petit:
Recognizable Complex Trace Languages.
MFCS 1991: 131-140 |
| 4 | | Paul Gastin:
Recognizable and Rational Languages of Finite and Infinite Traces.
STACS 1991: 89-104 |
| 1990 |
|---|
| 3 | | Paul Gastin:
Infinite Traces.
Semantics of Systems of Concurrent Processes 1990: 277-308 |
| 2 | | Joffroy Beauquier,
Paul Gastin,
Vincent Villain:
A Linear Fault-Tolerant Naming Algorithm.
WDAG 1990: 57-70 |
| 1 | | Paul Gastin:
Un Modèle Asynchrone pour les Systèmes Distribués.
Theor. Comput. Sci. 74(1): 121-162 (1990) |
