Infinite Traces. - Paul Gastin (Semantics of Systems of Concurrent Processes, 1990)

A Linear Fault-Tolerant Naming Algorithm. - Joffroy Beauquier; Paul Gastin; Vincent Villain (WDAG, 1990)

Un Modèle Asynchrone pour les Systèmes Distribués. - Paul Gastin (Theor. Comput. Sci., 1990)

A Kleene Theorem for Infinite Trace Languages. - Paul Gastin; Antoine Petit 001; Wieslaw Zielonka (ICALP, 1991)

Recognizable Complex Trace Languages. - Volker Diekert; Paul Gastin; Antoine Petit 001 (MFCS, 1991)

Recognizable and Rational Languages of Finite and Infinite Traces. - Paul Gastin (STACS, 1991)

A survey of recognizable languages with infinite traces. - Paul Gastin; Antoine Petit 001 (Advances in Petri Nets: The DEMON Project, 1992)

Asynchronous Cellular Automata for Infinite Traces. - Paul Gastin; Antoine Petit 001 (ICALP, 1992)

Poset Properties of Complex Traces. - Paul Gastin; Antoine Petit 001 (MFCS, 1992)

Decidability of the Star Problem in A* x {b}*. - Paul Gastin; Edward Ochmanski; Antoine Petit 001; Brigitte Rozoy (Inf. Process. Lett., 1992)

An Efficient Crash-tolerant Sequential Traversal. - Paul Gastin; Vincent Villain (Parallel Process. Lett., 1993)

The Poset of Infinitary Traces. - Paul Gastin; Brigitte Rozoy (Theor. Comput. Sci., 1993)

An Extension of Kleene's and Ochmanski's Theorems to Infinite Traces. - Paul Gastin; Antoine Petit 001; Wieslaw Zielonka (Theor. Comput. Sci., 1994)

Infinite Traces. - Paul Gastin; Antoine Petit 001 (The Book of Traces, 1995)

Recent Developments in Trace Theory. - Volker Diekert; Paul Gastin; Antoine Petit 001 (Developments in Language Theory, 1995)

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

On Congruences and Partial Orders. - Serge Bauget; Paul Gastin (MFCS, 1995)

Rational and Recognizable Complex Trace Languages - Volker Diekert; Paul Gastin; Antoine Petit 001 (Inf. Comput., 1995)

Asynchronous Cellular Automata for Pomsets Without Auto-concurrency. - Manfred Droste; Paul Gastin (CONCUR, 1996)

On the Power of Non-Observable Actions in Timed Automata. - Béatrice Bérard; Paul Gastin; Antoine Petit 001 (STACS, 1996)

On Recognizable and Rational Formal Power Series in Partially Commuting Variables. - Manfred Droste; Paul Gastin (ICALP, 1997)

Removing epsilon-Transitions in Timed Automata. - Volker Diekert; Paul Gastin; Antoine Petit 001 (STACS, 1997)

A (Non-elementary) Modular Decision Procedure for LTrL. - Paul Gastin; Raphaël Meyer; Antoine Petit 001 (MFCS, 1998)

Approximating Traces. - Volker Diekert; Paul Gastin (Acta Informatica, 1998)

Characterization of the Expressive Power of Silent Transitions in Timed Automata. - Béatrice Bérard; Antoine Petit 001; Volker Diekert; Paul Gastin (Fundam. Informaticae, 1998)

An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz Traces. - Volker Diekert; Paul Gastin (CSL, 1999)

A Truly Concurrent Semantics for a Simple Parallel Programming Language. - Paul Gastin; Michael W. Mislove (CSL, 1999)

The Kleene-Schützenberger Theorem for Formal Power Series in Partially Commuting Variables. - Manfred Droste; Paul Gastin (Inf. Comput., 1999)

Asynchronous cellular automata for pomsets. - Manfred Droste; Paul Gastin; Dietrich Kuske (Theor. Comput. Sci., 2000)

Fast LTL to Büchi Automata Translation. - Paul Gastin; Denis Oddoux (CAV, 2001)

Avoiding State Explosion for Distributed Systems with Timestamps. - Fabrice Derepas; Paul Gastin; David Plainfossé (FME, 2001)

Model Checking Systems of Replicated Processes with Spin. - Fabrice Derepas; Paul Gastin (SPIN, 2001)

Safety and Liveness Properties for Real Traces and a Direct Translation from LTL to Monoids. - Volker Diekert; Paul Gastin (Formal and Natural Computing, 2002)

An Elementary Expressively Complete Temporal Logic for Mazurkiewicz Traces. - Paul Gastin; Madhavan Mukund (ICALP, 2002)

Editorial. - Manfred Droste; Paul Gastin (J. Autom. Lang. Comb., 2002)

LTL Is Expressively Complete for Mazurkiewicz Traces. - Volker Diekert; Paul Gastin (J. Comput. Syst. Sci., 2002)

A truly concurrent semantics for a process algebra using resource pomsets. - Paul Gastin; Michael W. Mislove (Theor. Comput. Sci., 2002)

Resource traces: a domain for processes sharing exclusive resources. - Paul Gastin; Dan Teodosiu 001 (Theor. Comput. Sci., 2002)

Satisfiability and Model Checking for MSO-definable Temporal Logics are in PSPACE. - Paul Gastin; Dietrich Kuske (CONCUR, 2003)

Local LTL with Past Constants Is Expressively Complete for Mazurkiewicz Traces. - Paul Gastin; Madhavan Mukund; K. Narayan Kumar (MFCS, 2003)

LTL with Past and Two-Way Very-Weak Alternating Automata. - Paul Gastin; Denis Oddoux (MFCS, 2003)

Distributed Games with Causal Memory Are Decidable for Series-Parallel Systems. - Paul Gastin; Benjamin Lerman; Marc Zeitoun (FSTTCS, 2004)

Distributed Games and Distributed Control for Asynchronous Systems. - Paul Gastin; Benjamin Lerman; Marc Zeitoun (LATIN, 2004)

Minimization of Counterexamples in SPIN. - Paul Gastin; Pierre Moro; Marc Zeitoun (SPIN, 2004)

Local temporal logic is expressively complete for cograph dependence alphabets. - Volker Diekert; Paul Gastin (Inf. Comput., 2004)

A simple process algebra based on atomic actions with resources. - Paul Gastin; Michael W. Mislove (Math. Struct. Comput. Sci., 2004)

A Fresh Look at Testing for Asynchronous Communication. - Puneet Bhateja; Paul Gastin; Madhavan Mukund (ATVA, 2006)

Intersection of Regular Signal-Event (Timed) Languages. - Béatrice Bérard; Paul Gastin; Antoine Petit 001 (FORMATS, 2006)

Refinements and Abstractions of Signal-Event (Timed) Languages. - Béatrice Bérard; Paul Gastin; Antoine Petit 001 (FORMATS, 2006)

Pure future local temporal logics are expressively complete for Mazurkiewicz traces. - Volker Diekert; Paul Gastin (Inf. Comput., 2006)

Editorial. - Siva Anantharaman; Paul Gastin; Gaétan Hains; John Mullins; Michaël Rusinowitch (J. Autom. Lang. Comb., 2006)

From local to global temporal logics over Mazurkiewicz traces. - Volker Diekert; Paul Gastin (Theor. Comput. Sci., 2006)

Local Testing of Message Sequence Charts Is Difficult. - Puneet Bhateja; Paul Gastin; Madhavan Mukund; K. Narayan Kumar (FCT, 2007)

Automata and Logics for Timed Message Sequence Charts. - S. Akshay 001; Benedikt Bollig; Paul Gastin (FSTTCS, 2007)

Minimal Counterexample Generation for SPIN. - Paul Gastin; Pierre Moro (SPIN, 2007)

Timed substitutions for regular signal-event languages. - Béatrice Bérard; Paul Gastin; Antoine Petit 001 (Formal Methods Syst. Des., 2007)

Uniform Satisfiability in PSPACE for Local Temporal Logics Over Mazurkiewicz Traces. - Paul Gastin; Dietrich Kuske (Fundam. Informaticae, 2007)

Weighted automata and weighted logics. - Manfred Droste; Paul Gastin (Theor. Comput. Sci., 2007)

First-order definable languages. - Volker Diekert; Paul Gastin (Logic and Automata, 2008)

A Survey on Small Fragments of First-Order Logic over Finite Words. - Volker Diekert; Paul Gastin; Manfred Kufleitner (Int. J. Found. Comput. Sci., 2008)

On Aperiodic and Star-Free Formal Power Series in Partially Commuting Variables. - Manfred Droste; Paul Gastin (Theory Comput. Syst., 2008)

Weighted versus Probabilistic Logics. - Benedikt Bollig; Paul Gastin (Developments in Language Theory, 2009)

Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems. - Thomas Chatain; Paul Gastin; Nathalie Sznajder (SOFSEM, 2009)

Distributed synthesis for well-connected architectures. - Paul Gastin; Nathalie Sznajder; Marc Zeitoun (Formal Methods Syst. Des., 2009)

10031 Abstracts Collection - Quantitative Models: Expressiveness and Analysis. - Christel Baier; Manfred Droste; Paul Gastin; Kim Guldstrand Larsen (Quantitative Models: Expressiveness and Analysis, 2010)

10031 Executive Summary - Quantitative Models: Expressiveness and Analysis. - Christel Baier; Manfred Droste; Paul Gastin; Kim Guldstrand Larsen (Quantitative Models: Expressiveness and Analysis, 2010)

Model checking time-constrained scenario-based specifications. - S. Akshay 001; Paul Gastin; Madhavan Mukund; K. Narayan Kumar (FSTTCS, 2010)

Pebble Weighted Automata and Transitive Closure Logics. - Benedikt Bollig; Paul Gastin; Benjamin Monmege; Marc Zeitoun (ICALP (2), 2010)

Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces. - Paul Gastin; Dietrich Kuske (Inf. Comput., 2010)

Specification and Verification using Temporal Logics. - Stéphane Demri; Paul Gastin (Modern Applications of Automata Theory, 2012)

A Probabilistic Kleene Theorem. - Benedikt Bollig; Paul Gastin; Benjamin Monmege; Marc Zeitoun (ATVA, 2012)

MSO Decidability of Multi-Pushdown Systems via Split-Width. - Aiswarya Cyriac; Paul Gastin; K. Narayan Kumar (CONCUR, 2012)

Model Checking Languages of Data Words. - Benedikt Bollig; Aiswarya Cyriac; Paul Gastin; K. Narayan Kumar (FoSSaCS, 2012)

Adding Pebbles to Weighted Automata. - Paul Gastin; Benjamin Monmege (CIAA, 2012)

Decidability of well-connectedness for distributed synthesis. - Paul Gastin; Nathalie Sznajder (Inf. Process. Lett., 2012)

Weighted Specifications over Nested Words. - Benedikt Bollig; Paul Gastin; Benjamin Monmege (FoSSaCS, 2013)

Event clock message passing automata: a logical characterization and an emptiness checking algorithm. - S. Akshay 001; Benedikt Bollig; Paul Gastin (Formal Methods Syst. Des., 2013)

Fair Synthesis for Asynchronous Distributed Systems. - Paul Gastin; Nathalie Sznajder (ACM Trans. Comput. Log., 2013)

Verifying Communicating Multi-pushdown Systems via Split-Width. - C. Aiswarya; Paul Gastin; K. Narayan Kumar (ATVA, 2014)

Controllers for the Verification of Communicating Multi-pushdown Systems. - C. Aiswarya; Paul Gastin; K. Narayan Kumar (CONCUR, 2014)

Logical characterization of weighted pebble walking automata. - Benedikt Bollig; Paul Gastin; Benjamin Monmege; Marc Zeitoun (CSL-LICS, 2014)

Parameterized Communicating Automata: Complementation and Model Checking. - Benedikt Bollig; Paul Gastin; Akshay Kumar (FSTTCS, 2014)

Reasoning About Distributed Systems: WYSIWYG (Invited Talk). - C. Aiswarya; Paul Gastin (FSTTCS, 2014)

Parameterized Verification of Communicating Automata under Context Bounds. - Benedikt Bollig; Paul Gastin; Jana Schubert (RP, 2014)

Distributed Timed Automata with Independently Evolving Clocks. - S. Akshay 001; Benedikt Bollig; Paul Gastin; Madhavan Mukund; K. Narayan Kumar (Fundam. Informaticae, 2014)

Temporal logics for concurrent recursive programs: Satisfiability and model checking. - Benedikt Bollig; C. Aiswarya; Paul Gastin; Marc Zeitoun (J. Appl. Log., 2014)

Adding pebbles to weighted automata: Easy specification & efficient evaluation. - Paul Gastin; Benjamin Monmege (Theor. Comput. Sci., 2014)

Pebble Weighted Automata and Weighted Logics. - Benedikt Bollig; Paul Gastin; Benjamin Monmege; Marc Zeitoun (ACM Trans. Comput. Log., 2014)

Checking conformance for time-constrained scenario-based specifications. - S. Akshay 001; Paul Gastin; Madhavan Mukund; K. Narayan Kumar (Theor. Comput. Sci., 2015)

Verification of Parameterized Communicating Automata via Split-Width. - Marie Fortin; Paul Gastin (FoSSaCS, 2016)

Nested Words for Order-2 Pushdown Systems. - C. Aiswarya; Paul Gastin; Prakash Saivasan (CoRR, 2016)

Towards an Efficient Tree Automata Based Technique for Timed Systems. - S. Akshay 001; Paul Gastin; Shankara Narayanan Krishna; Ilias Sarkar (CONCUR, 2017)

It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with "Happened Before". - Benedikt Bollig; Marie Fortin; Paul Gastin (CONCUR, 2018)

Reachability in Timed Automata with Diagonal Constraints. - Paul Gastin; Sayan Mukherjee 002; B. Srivathsan (CONCUR, 2018)

Communicating Finite-State Machines and Two-Variable Logic. - Benedikt Bollig; Marie Fortin; Paul Gastin (STACS, 2018)

Gossiping in Message-Passing Systems. - Benedikt Bollig; Marie Fortin; Paul Gastin (CoRR, 2018)

Unambiguous Forest Factorization. - Paul Gastin; Shankara Narayanan Krishna (CoRR, 2018)

An automata-theoretic approach to the verification of distributed algorithms. - C. Aiswarya; Benedikt Bollig; Paul Gastin (Inf. Comput., 2018)

Analyzing Timed Systems Using Tree Automata. - S. Akshay 001; Paul Gastin; Shankara Narayanan Krishna (Log. Methods Comput. Sci., 2018)

A unifying survey on weighted logics and weighted automata - Core weighted logic: minimal and versatile specification of quantitative properties. - Paul Gastin; Benjamin Monmege (Soft Comput., 2018)

Modular Descriptions of Regular Functions. - Paul Gastin (CAI, 2019)

Fast Algorithms for Handling Diagonal Constraints in Timed Automata. - Paul Gastin; Sayan Mukherjee 002; B. Srivathsan (CAV (1), 2019)

Logics for Reversible Regular Languages and Semigroups with Involution. - Paul Gastin; Amaldev Manuel; R. Govind 001 (DLT, 2019)

Timed Systems through the Lens of Logic. - S. Akshay 001; Paul Gastin; Vincent Jugé; Shankara Narayanan Krishna (LICS, 2019)

Aperiodic Weighted Automata and Weighted First-Order Logic. - Manfred Droste; Paul Gastin (MFCS, 2019)

Non-Sequential Theory of Distributed Systems. - Benedikt Bollig; Paul Gastin (CoRR, 2019)

Wreath/Cascade Products and Related Decomposition Results for the Concurrent Setting of Mazurkiewicz Traces. - Bharat Adsul; Paul Gastin; Saptarshi Sarkar 001; Pascal Weil (CONCUR, 2020)

Weighted Tiling Systems for Graphs: Evaluation Complexity. - C. Aiswarya; Paul Gastin (FSTTCS, 2020)

Reachability for Updatable Timed Automata Made Faster and More Effective. - Paul Gastin; Sayan Mukherjee 002; B. Srivathsan (FSTTCS, 2020)

Register Transducers Are Marble Transducers. - Gaëtan Douéneau-Tabot; Emmanuel Filiot; Paul Gastin (MFCS, 2020)

Revisiting Underapproximate Reachability for Multipushdown Systems. - S. Akshay 001; Paul Gastin; S. Krishna 004; Sparsa Roychowdhury (TACAS (1), 2020)

Wreath/cascade products and related decomposition results for the concurrent setting of Mazurkiewicz traces (extended version). - Bharat Adsul; Paul Gastin; Saptarshi Sarkar 001; Pascal Weil (CoRR, 2020)

Fast Zone-Based Algorithms for Reachability in Pushdown Timed Automata. - S. Akshay 001; Paul Gastin; Karthik R. Prakash (CAV (1), 2021)

SD-Regular Transducer Expressions for Aperiodic Transformations. - Luc Dartois; Paul Gastin; Shankara Narayanan Krishna (LICS, 2021)

Reversible Regular Languages: Logical and Algebraic Characterisations. - Paul Gastin; Amaldev Manuel; R. Govind 001 (Fundam. Informaticae, 2021)

Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic. - Benedikt Bollig; Marie Fortin; Paul Gastin (J. Comput. Syst. Sci., 2021)

Propositional Dynamic Logic and Asynchronous Cascade Decompositions for Regular Trace Languages. - Bharat Adsul; Paul Gastin; Saptarshi Sarkar 001; Pascal Weil (CONCUR, 2022)

CONCUR Test-Of-Time Award 2022 (Invited Paper). - Ilaria Castellani; Paul Gastin; Orna Kupferman; Mickael Randour; Davide Sangiorgi (CONCUR, 2022)

Zone-Based Verification of Timed Automata: Extrapolations, Simulations and What Next? - Patricia Bouyer; Paul Gastin; Frédéric Herbreteau; Ocan Sankur; B. Srivathsan (FORMATS, 2022)

Efficient Construction of Reversible Transducers from Regular Transducer Expressions. - Luc Dartois; Paul Gastin; R. Govind 001; Shankara Narayanan Krishna (LICS, 2022)

Regular transducer expressions for regular transformations. - Vrunda Dave; Paul Gastin; Shankara Narayanan Krishna (Inf. Comput., 2022)

Asynchronous wreath product and cascade decompositions for concurrent behaviours. - Bharat Adsul; Paul Gastin; Saptarshi Sarkar 001; Pascal Weil (Log. Methods Comput. Sci., 2022)

A Unified Model for Real-Time Systems: Symbolic Techniques and Implementation. - S. Akshay 001; Paul Gastin; R. Govind 001; Aniruddha R. Joshi; B. Srivathsan (CAV (1), 2023)

MITL Model Checking via Generalized Timed Automata and a New Liveness Algorithm. - S. Akshay 001; Paul Gastin; R. Govind 001; B. Srivathsan (CONCUR, 2024)

Reversible Transducers over Infinite Words. - Luc Dartois; Paul Gastin; Loïc Germerie Guizouarn; R. Govind 001; Shankaranarayanan Krishna (CONCUR, 2024)

An expressively complete local past propositional dynamic logic over Mazurkiewicz traces and its applications. - Bharat Adsul; Paul Gastin; Shantanu Kulkarni; Pascal Weil (LICS, 2024)

Propositional dynamic logic and asynchronous cascade decompositions for regular trace languages. - Bharat Adsul; Paul Gastin; Shantanu Kulkarni; Pascal Weil (CoRR, 2024)

Simulations for Event-Clock Automata. - S. Akshay 001; Paul Gastin; R. Govind 001; B. Srivathsan (Log. Methods Comput. Sci., 2024)

High-Level Message Sequence Charts: Satisfiability and Realizability Revisited. - Benedikt Bollig; Marie Fortin; Paul Gastin (Petri Nets, 2025)

Characterizations of Fragments of Temporal Logic over Mazurkiewicz Traces. - Bharat Adsul; Paul Gastin; Shantanu Kulkarni (CONCUR, 2025)

Reversible Pebble Transducers. - Luc Dartois; Paul Gastin; Loïc Germerie Guizouarn; Shankaranarayanan Krishna (CONCUR, 2025)

Special issue on 10th international workshop Weighted Automata: Theory and Applications (WATA 2020). - Manfred Droste; Paul Gastin; Benjamin Monmege (Inf. Comput., 2025)