Paul Gastin - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model CheckingBenedikt Bollig, Aiswarya Cyriac, Paul Gastin, Marc Zeitoun. mfcs 2011: 132-144 [doi]

2010

Model checking time-constrained scenario-based specificationsS. Akshay, Paul Gastin, Madhavan Mukund, K. Narayan Kumar. fsttcs 2010: 204-215 [doi]

Pebble Weighted Automata and Transitive Closure LogicsBenedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun. icalp 2010: 587-598 [doi]

CONCUR 2010 - Concurrency Theory, 21th International Conference, CONCUR 2010, Paris, France, August 31-September 3, 2010. ProceedingsPaul Gastin, François Laroussinie, editors, Volume 6269 of Lecture Notes in Computer Science, Springer, 2010. [doi]

Uniform satisfiability problem for local temporal logics over Mazurkiewicz tracesPaul Gastin, Dietrich Kuske. iandc, 208(7):797-816, 2010. [doi]

2009

Weighted versus Probabilistic LogicsBenedikt Bollig, Paul Gastin. dlt 2009: 18-38 [doi]

Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous SystemsThomas Chatain, Paul Gastin, Nathalie Sznajder. sofsem 2009: 141-152 [doi]

Distributed synthesis for well-connected architecturesPaul Gastin, Nathalie Sznajder, Marc Zeitoun. fmsd, 34(3):215-237, 2009. [doi]

2008

2007

2006

2005

Weighted Automata and Weighted LogicsManfred Droste, Paul Gastin. icalp 2005: 513-525 [doi]

Uniform Satisfiability Problem for Local Temporal Logics over Mazurkiewicz TracesPaul Gastin, Dietrich Kuske. concur 2005: 533-547 [doi]

2004

2003

LTL with Past and Two-Way Very-Weak Alternating AutomataPaul Gastin, Denis Oddoux. mfcs 2003: 439-448 [doi]

Local LTL with Past Constants Is Expressively Complete for Mazurkiewicz TracesPaul Gastin, Madhavan Mukund, K. Narayan Kumar. mfcs 2003: 429-438 [doi]

Satisfiability and Model Checking for MSO-definable Temporal Logics are in PSPACEPaul Gastin, Dietrich Kuske. concur 2003: 218-232 [doi]

2002

2001

2000

LTL Is Expressively Complete for Mazurkiewicz TracesVolker Diekert, Paul Gastin. icalp 2000: 211-222 [doi]

Asynchronous cellular automata for pomsetsManfred Droste, Paul Gastin, Dietrich Kuske. TCS, 247(1-2):1-38, 2000. [doi]

1999

An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz TracesVolker Diekert, Paul Gastin. csl 1999: 188-203

The Kleene-Schützenberger Theorem for Formal Power Series in Partially Commuting VariablesManfred Droste, Paul Gastin. iandc, 153(1):47-80, 1999.

A Truly Concurrent Semantics for a Simple Parallel Programming LanguagePaul Gastin, Michael W. Mislove. csl 1999: 515-529

1998

Characterization of the Expressive Power of Silent Transitions in Timed AutomataBéatrice Bérard, Antoine Petit, Volker Diekert, Paul Gastin. FUIN, 36(2-3):145-182, 1998.

Approximating TracesVolker Diekert, Paul Gastin. ACTA, 35(7):567-593, 1998. [doi]

A (Non-elementary) Modular Decision Procedure for LTrLPaul Gastin, Raphaël Meyer, Antoine Petit. mfcs 1998: 356-365 [doi]

1997

Removing epsilon-Transitions in Timed AutomataVolker Diekert, Paul Gastin, Antoine Petit. STACS 1997: 583-594

On Recognizable and Rational Formal Power Series in Partially Commuting VariablesManfred Droste, Paul Gastin. icalp 1997: 682-692

1996

On the Power of Non-Observable Actions in Timed AutomataBéatrice Bérard, Paul Gastin, Antoine Petit. STACS 1996: 257-268

Asynchronous Cellular Automata for Pomsets Without Auto-concurrencyManfred Droste, Paul Gastin. concur 1996: 627-638

1995

On Congruences and Partial OrdersSerge Bauget, Paul Gastin. mfcs 1995: 434-443

Recent Developments in Trace TheoryVolker Diekert, Paul Gastin, Antoine Petit. dlt 1995: 373-385

Rational and Recognizable Complex Trace LanguagesVolker Diekert, Paul Gastin, Antoine Petit. iandc, 116(1):134-153, January 1995.

A Domain for Concurrent Termination: A Generalization of Mazurkiewicz Traces (Extended Abstract)Volker Diekert, Paul Gastin. icalp 1995: 15-26

1994

An Extension of Kleene s and Ochmanski s Theorems to Infinite TracesPaul Gastin, Antoine Petit, Wieslaw Zielonka. TCS, 125(2):167-204, 1994.

1993

The Poset of Infinitary TracesPaul Gastin, Brigitte Rozoy. TCS, 120(1):101-121, 1993.

An Efficient Crash-tolerant Sequential TraversalPaul Gastin, Vincent Villain. ppl, 3:87-97, 1993.

1992

Poset Properties of Complex TracesPaul Gastin, Antoine Petit. mfcs 1992: 255-263

Asynchronous Cellular Automata for Infinite TracesPaul Gastin, Antoine Petit. icalp 1992: 583-594

Decidability of the Star Problem in A* x {b}*Paul Gastin, Edward Ochmanski, Antoine Petit, Brigitte Rozoy. ipl, 44(2):65-71, 1992.

A survey of recognizable languages with infinite tracesPaul Gastin, Antoine Petit. apn 1992: 392-409

1991

Recognizable Complex Trace LanguagesVolker Diekert, Paul Gastin, Antoine Petit. mfcs 1991: 131-140

A Kleene Theorem for Infinite Trace LanguagesPaul Gastin, Antoine Petit, Wieslaw Zielonka. icalp 1991: 254-266

Recognizable and Rational Languages of Finite and Infinite TracesPaul Gastin. STACS 1991: 89-104

1990

A Linear Fault-Tolerant Naming AlgorithmJoffroy Beauquier, Paul Gastin, Vincent Villain. wdag 1991: 57-70

Infinite TracesPaul Gastin. litp 1990: 277-308

Un Modèle Asynchrone pour les Systèmes DistribuésPaul Gastin. TCS, 74(1):121-162, 1990.