| 2026 | TACAS | TEMPORA: Efficient Verification of Metric Temporal Properties with Past in Pointwise Semantics. | S. Akshay, Prerak Contractor, Paul Gastin, R. Govind, B. Srivathsan |
| 2025 | CONCUR | Characterizations of Fragments of Temporal Logic over Mazurkiewicz Traces. | Bharat Adsul, Paul Gastin, Shantanu Kulkarni |
| 2025 | CONCUR | Reversible Pebble Transducers. | Luc Dartois, Paul Gastin, Loc Germerie Guizouarn, Shankaranarayanan Krishna |
| 2024 | CONCUR | MITL Model Checking via Generalized Timed Automata and a New Liveness Algorithm. | S. Akshay, Paul Gastin, R. Govind, B. Srivathsan |
| 2024 | CONCUR | Reversible Transducers over Infinite Words. | Luc Dartois, Paul Gastin, Loc Germerie Guizouarn, R. Govind, Shankaranarayanan Krishna |
| 2024 | LICS | An expressively complete local past propositional dynamic logic over Mazurkiewicz traces and its applications. | Bharat Adsul, Paul Gastin, Shantanu Kulkarni, Pascal Weil |
| 2023 | CAV | A Unified Model for Real-Time Systems: Symbolic Techniques and Implementation. | S. Akshay, Paul Gastin, R. Govind, Aniruddha R. Joshi, B. Srivathsan |
| 2022 | CONCUR | Simulations for Event-Clock Automata. | S. Akshay, Paul Gastin, R. Govind, B. Srivathsan |
| 2022 | CONCUR | Propositional Dynamic Logic and Asynchronous Cascade Decompositions for Regular Trace Languages. | Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil |
| 2022 | CONCUR | CONCUR Test-Of-Time Award 2022 (Invited Paper). | Ilaria Castellani, Paul Gastin, Orna Kupferman, Mickael Randour, Davide Sangiorgi |
| 2022 | LICS | Efficient Construction of Reversible Transducers from Regular Transducer Expressions. | Luc Dartois, Paul Gastin, R. Govind, Shankara Narayanan Krishna |
| 2021 | CAV | Fast Zone-Based Algorithms for Reachability in Pushdown Timed Automata. | S. Akshay, Paul Gastin, Karthik R. Prakash |
| 2021 | LICS | SD-Regular Transducer Expressions for Aperiodic Transformations. | Luc Dartois, Paul Gastin, Shankara Narayanan Krishna |
| 2020 | CONCUR | Wreath/Cascade Products and Related Decomposition Results for the Concurrent Setting of Mazurkiewicz Traces. | Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil |
| 2020 | MFCS | Register Transducers Are Marble Transducers. | Gatan Douneau-Tabot, Emmanuel Filiot, Paul Gastin |
| 2020 | TACAS | Revisiting Underapproximate Reachability for Multipushdown Systems. | S. Akshay, Paul Gastin, S. Krishna, Sparsa Roychowdhury |
| 2019 | CAV | Fast Algorithms for Handling Diagonal Constraints in Timed Automata. | Paul Gastin, Sayan Mukherjee, B. Srivathsan |
| 2019 | DLT | Logics for Reversible Regular Languages and Semigroups with Involution. | Paul Gastin, Amaldev Manuel, R. Govind |
| 2019 | LICS | Timed Systems through the Lens of Logic. | S. Akshay, Paul Gastin, Vincent Jug, Shankara Narayanan Krishna |
| 2019 | MFCS | Aperiodic Weighted Automata and Weighted First-Order Logic. | Manfred Droste, Paul Gastin |
| 2018 | CONCUR | 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 |
| 2018 | CONCUR | Reachability in Timed Automata with Diagonal Constraints. | Paul Gastin, Sayan Mukherjee, B. Srivathsan |
| 2018 | LICS | Regular Transducer Expressions for Regular Transformations. | Vrunda Dave, Paul Gastin, Shankara Narayanan Krishna |
| 2018 | STACS | Communicating Finite-State Machines and Two-Variable Logic. | Benedikt Bollig, Marie Fortin, Paul Gastin |
| 2017 | CONCUR | Towards an Efficient Tree Automata Based Technique for Timed Systems. | S. Akshay, Paul Gastin, Shankara Narayanan Krishna, Ilias Sarkar |
| 2016 | CONCUR | Analyzing Timed Systems Using Tree Automata. | S. Akshay, Paul Gastin, Shankara Narayanan Krishna |
| 2016 | FOSSACS | Verification of Parameterized Communicating Automata via Split-Width. | Marie Fortin, Paul Gastin |
| 2015 | CONCUR | An Automata-Theoretic Approach to the Verification of Distributed Algorithms. | C. Aiswarya, Benedikt Bollig, Paul Gastin |
| 2014 | ATVA | Verifying Communicating Multi-pushdown Systems via Split-Width. | C. Aiswarya, Paul Gastin, K. Narayan Kumar |
| 2014 | CONCUR | Controllers for the Verification of Communicating Multi-pushdown Systems. | C. Aiswarya, Paul Gastin, K. Narayan Kumar |
| 2014 | CSL | Logical characterization of weighted pebble walking automata. | Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun |
| 2013 | FOSSACS | Weighted Specifications over Nested Words. | Benedikt Bollig, Paul Gastin, Benjamin Monmege |
| 2012 | ATVA | A Probabilistic Kleene Theorem. | Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun |
| 2012 | CONCUR | MSO Decidability of Multi-Pushdown Systems via Split-Width. | Aiswarya Cyriac, Paul Gastin, K. Narayan Kumar |
| 2012 | FOSSACS | Model Checking Languages of Data Words. | Benedikt Bollig, Aiswarya Cyriac, Paul Gastin, K. Narayan Kumar |
| 2011 | MFCS | Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking. | Benedikt Bollig, Aiswarya Cyriac, Paul Gastin, Marc Zeitoun |
| 2010 | ICALP | Pebble Weighted Automata and Transitive Closure Logics. | Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun |
| 2009 | DLT | Weighted versus Probabilistic Logics. | Benedikt Bollig, Paul Gastin |
| 2009 | SOFSEM | Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems. | Thomas Chatain, Paul Gastin, Nathalie Sznajder |
| 2008 | CONCUR | Distributed Timed Automata with Independently Evolving Clocks. | S. Akshay, Benedikt Bollig, Paul Gastin, Madhavan Mukund, K. Narayan Kumar |
| 2007 | FCT | Local Testing of Message Sequence Charts Is Difficult. | Puneet Bhateja, Paul Gastin, Madhavan Mukund, K. Narayan Kumar |
| 2006 | ATVA | A Fresh Look at Testing for Asynchronous Communication. | Puneet Bhateja, Paul Gastin, Madhavan Mukund |
| 2005 | CONCUR | Uniform Satisfiability Problem for Local Temporal Logics over Mazurkiewicz Traces. | Paul Gastin, Dietrich Kuske |
| 2005 | ICALP | Weighted Automata and Weighted Logics. | Manfred Droste, Paul Gastin |
| 2004 | LATIN | Pure Future Local Temporal Logics Are Expressively Complete for Mazurkiewicz Traces. | Volker Diekert, Paul Gastin |
| 2004 | LATIN | Distributed Games and Distributed Control for Asynchronous Systems. | Paul Gastin, Benjamin Lerman, Marc Zeitoun |
| 2003 | CONCUR | Satisfiability and Model Checking for MSO-definable Temporal Logics are in PSPACE. | Paul Gastin, Dietrich Kuske |
| 2003 | MFCS | Local LTL with Past Constants Is Expressively Complete for Mazurkiewicz Traces. | Paul Gastin, Madhavan Mukund, K. Narayan Kumar |
| 2003 | MFCS | LTL with Past and Two-Way Very-Weak Alternating Automata. | Paul Gastin, Denis Oddoux |
| 2002 | ICALP | An Elementary Expressively Complete Temporal Logic for Mazurkiewicz Traces. | Paul Gastin, Madhavan Mukund |
| 2001 | CAV | Fast LTL to Bchi Automata Translation. | Paul Gastin, Denis Oddoux |
| 2001 | FM | Avoiding State Explosion for Distributed Systems with Timestamps. | Fabrice Derepas, Paul Gastin, David Plainfoss |
| 2001 | LPAR | Local Temporal Logic is Expressively Complete for Cograph Dependence Alphabets. | Volker Diekert, Paul Gastin |
| 2000 | ICALP | LTL Is Expressively Complete for Mazurkiewicz Traces. | Volker Diekert, Paul Gastin |
| 1999 | CSL | An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz Traces. | Volker Diekert, Paul Gastin |
| 1999 | CSL | A Truly Concurrent Semantics for a Simple Parallel Programming Language. | Paul Gastin, Michael W. Mislove |
| 1998 | MFCS | A (Non-elementary) Modular Decision Procedure for LTrL. | Paul Gastin, Raphal Meyer, Antoine Petit |
| 1997 | ICALP | On Recognizable and Rational Formal Power Series in Partially Commuting Variables. | Manfred Droste, Paul Gastin |
| 1997 | STACS | Removing epsilon-Transitions in Timed Automata. | Volker Diekert, Paul Gastin, Antoine Petit |
| 1996 | CONCUR | Asynchronous Cellular Automata for Pomsets Without Auto-concurrency. | Manfred Droste, Paul Gastin |
| 1996 | STACS | On the Power of Non-Observable Actions in Timed Automata. | Batrice Brard, Paul Gastin, Antoine Petit |
| 1995 | DLT | Recent Developments in Trace Theory. | Volker Diekert, Paul Gastin, Antoine Petit |
| 1995 | ICALP | A Domain for Concurrent Termination: A Generalization of Mazurkiewicz Traces (Extended Abstract). | Volker Diekert, Paul Gastin |
| 1995 | MFCS | On Congruences and Partial Orders. | Serge Bauget, Paul Gastin |
| 1992 | ICALP | Asynchronous Cellular Automata for Infinite Traces. | Paul Gastin, Antoine Petit |
| 1992 | MFCS | Poset Properties of Complex Traces. | Paul Gastin, Antoine Petit |
| 1991 | ICALP | A Kleene Theorem for Infinite Trace Languages. | Paul Gastin, Antoine Petit, Wieslaw Zielonka |
| 1991 | MFCS | Recognizable Complex Trace Languages. | Volker Diekert, Paul Gastin, Antoine Petit |
| 1991 | STACS | Recognizable and Rational Languages of Finite and Infinite Traces. | Paul Gastin |