Paul Gastin

ORCID

Publication Activity (10 Years)

Years Active: 1990-2024
Publications (10 Years): 69

Top Venues

Publications

Luc Dartois, Paul Gastin, Loïc Germerie Guizouarn, R. Govind, Shankaranarayanan Krishna
Reversible Transducers over Infinite Words. CoRR (2024)
S. Akshay, Paul Gastin, R. Govind, B. Srivathsan
MITL Model Checking via Generalized Timed Automata and a New Liveness Algorithm. CoRR (2024)
Bharat Adsul, Paul Gastin, Shantanu Kulkarni, Pascal Weil
An expressively complete local past propositional dynamic logic over Mazurkiewicz traces and its applications. LICS (2024)
Luc Dartois, Paul Gastin, Loïc Germerie Guizouarn, R. Govind, Shankaranarayanan Krishna
Reversible Transducers over Infinite Words. CONCUR (2024)
S. Akshay, Paul Gastin, R. Govind, B. Srivathsan
Simulations for Event-Clock Automata. Log. Methods Comput. Sci. 20 (3) (2024)
Bharat Adsul, Paul Gastin, Shantanu Kulkarni, Pascal Weil
Propositional dynamic logic and asynchronous cascade decompositions for regular trace languages. CoRR (2024)
S. Akshay, Paul Gastin, R. Govind, B. Srivathsan
MITL Model Checking via Generalized Timed Automata and a New Liveness Algorithm. CONCUR (2024)
S. Akshay, Paul Gastin, R. Govind, Aniruddha R. Joshi, B. Srivathsan
A Unified Model for Real-Time Systems: Symbolic Techniques and Implementation. CAV (1) (2023)
S. Akshay, Paul Gastin, R. Govind, Aniruddha R. Joshi, B. Srivathsan
A Unified Model for Real-Time Systems: Symbolic Techniques and Implementation. CoRR (2023)
Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil
Asynchronous wreath product and cascade decompositions for concurrent behaviours. Log. Methods Comput. Sci. 18 (2) (2022)
Ilaria Castellani, Paul Gastin, Orna Kupferman, Mickael Randour, Davide Sangiorgi
CONCUR Test-Of-Time Award 2022 (Invited Paper). CONCUR (2022)
Luc Dartois, Paul Gastin, R. Govind, Shankara Narayanan Krishna
Efficient Construction of Reversible Transducers from Regular Transducer Expressions. LICS (2022)
Luc Dartois, Paul Gastin, R. Govind, Shankara Narayanan Krishna
Efficient Construction of Reversible Transducers from Regular Transducer Expressions. CoRR (2022)
Patricia Bouyer, Paul Gastin, Frédéric Herbreteau, Ocan Sankur, B. Srivathsan
Zone-based verification of timed automata: extrapolations, simulations and what next? CoRR (2022)
S. Akshay, Paul Gastin, R. Govind, B. Srivathsan
Simulations for Event-Clock Automata. CoRR (2022)
Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil
Propositional Dynamic Logic and Asynchronous Cascade Decompositions for Regular Trace Languages. CONCUR (2022)
Vrunda Dave, Paul Gastin, Shankara Narayanan Krishna
Regular transducer expressions for regular transformations. Inf. Comput. 282 (2022)
Patricia Bouyer, Paul Gastin, Frédéric Herbreteau, Ocan Sankur, B. Srivathsan
Zone-Based Verification of Timed Automata: Extrapolations, Simulations and What Next? FORMATS (2022)
S. Akshay, Paul Gastin, R. Govind, B. Srivathsan
Simulations for Event-Clock Automata. CONCUR (2022)
Benedikt Bollig, Marie Fortin, Paul Gastin
Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic. J. Comput. Syst. Sci. 115 (2021)
S. Akshay, Paul Gastin, Karthik R. Prakash
Fast Zone-Based Algorithms for Reachability in Pushdown Timed Automata. CAV (1) (2021)
Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil
Asynchronous wreath product and cascade decompositions for concurrent behaviours. CoRR (2021)
Paul Gastin, Amaldev Manuel, R. Govind
Reversible Regular Languages: Logical and Algebraic Characterisations. Fundam. Informaticae 180 (4) (2021)
S. Akshay, Paul Gastin, Karthik R. Prakash
Fast zone-based algorithms for reachability in pushdown timed automata. CoRR (2021)
Luc Dartois, Paul Gastin, Shankara Narayanan Krishna
SD-Regular Transducer Expressions for Aperiodic Transformations. LICS (2021)
Luc Dartois, Paul Gastin, Shankara Narayanan Krishna
SD-Regular Transducer Expressions for Aperiodic Transformations. CoRR (2021)
S. Akshay, Paul Gastin, Shankara Narayanan Krishna, Sparsa Roychowdhury
Revisiting Underapproximate Reachability for Multipushdown Systems. TACAS (1) (2020)
Paul Gastin, Sayan Mukherjee, B. Srivathsan
Reachability for Updatable Timed Automata Made Faster and More Effective. FSTTCS (2020)
S. Akshay, Paul Gastin, Shankara Narayanan Krishna, Sparsa Roychowdhury
Revisiting Underapproximate Reachability for Multipushdown Systems. CoRR (2020)
Gaëtan Douéneau-Tabot, Emmanuel Filiot, Paul Gastin
Register transducers are marble transducers. CoRR (2020)
Gaëtan Douéneau-Tabot, Emmanuel Filiot, Paul Gastin
Register Transducers Are Marble Transducers. MFCS (2020)
Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil
Wreath/cascade products and related decomposition results for the concurrent setting of Mazurkiewicz traces (extended version). CoRR (2020)
C. Aiswarya, Paul Gastin
Weighted Tiling Systems for Graphs: Evaluation Complexity. CoRR (2020)
Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil
Wreath/Cascade Products and Related Decomposition Results for the Concurrent Setting of Mazurkiewicz Traces. CONCUR (2020)
Paul Gastin, Sayan Mukherjee, B. Srivathsan
Reachability for Updatable Timed Automata made faster and more effective. CoRR (2020)
C. Aiswarya, Paul Gastin
Weighted Tiling Systems for Graphs: Evaluation Complexity. FSTTCS (2020)
Paul Gastin, Sayan Mukherjee, B. Srivathsan
Fast Algorithms for Handling Diagonal Constraints in Timed Automata. CAV (1) (2019)
Paul Gastin, Sayan Mukherjee, B. Srivathsan
Fast algorithms for handling diagonal constraints in timed automata. CoRR (2019)
Paul Gastin
Modular Descriptions of Regular Functions. CAI (2019)
Benedikt Bollig, Paul Gastin
Non-Sequential Theory of Distributed Systems. CoRR (2019)
S. Akshay, Paul Gastin, Vincent Jugé, Shankara Narayanan Krishna
Timed Systems through the Lens of Logic. CoRR (2019)
Manfred Droste, Paul Gastin
Aperiodic Weighted Automata and Weighted First-Order Logic. MFCS (2019)
Paul Gastin
Modular Descriptions of Regular Functions. CoRR (2019)
Manfred Droste, Paul Gastin
Aperiodic Weighted Automata and Weighted First-Order Logic. CoRR (2019)
Paul Gastin, Amaldev Manuel, R. Govind
Logics for Reversible Regular Languages and Semigroups with Involution. CoRR (2019)
Paul Gastin, Amaldev Manuel, R. Govind
Logics for Reversible Regular Languages and Semigroups with Involution. DLT (2019)
S. Akshay, Paul Gastin, Vincent Jugé, Shankara Narayanan Krishna
Timed Systems through the Lens of Logic. LICS (2019)
Vrunda Dave, Paul Gastin, Krishna Shankara Narayanan
Regular Transducer Expressions for Regular Transformations. CoRR (2018)
Paul Gastin, Sayan Mukherjee, B. Srivathsan
Reachability in timed automata with diagonal constraints. CoRR (2018)
C. Aiswarya, Benedikt Bollig, Paul Gastin
An automata-theoretic approach to the verification of distributed algorithms. Inf. Comput. 259 (3) (2018)
Benedikt Bollig, Marie Fortin, Paul Gastin
Gossiping in Message-Passing Systems. CoRR (2018)
Vrunda Dave, Paul Gastin, Shankara Narayanan Krishna
Regular Transducer Expressions for Regular Transformations. LICS (2018)
Paul Gastin, Sayan Mukherjee, B. Srivathsan
Reachability in Timed Automata with Diagonal Constraints. CONCUR (2018)
Benedikt Bollig, Marie Fortin, Paul Gastin
It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with "Happened Before". CONCUR (2018)
Paul Gastin, Shankara Narayanan Krishna
Unambiguous Forest Factorization. CoRR (2018)
Benedikt Bollig, Marie Fortin, Paul Gastin
Communicating Finite-State Machines and Two-Variable Logic. STACS (2018)
Benedikt Bollig, Marie Fortin, Paul Gastin
It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with "Happened Before". CoRR (2018)
S. Akshay, Paul Gastin, Shankara Narayanan Krishna
Analyzing Timed Systems Using Tree Automata. Log. Methods Comput. Sci. 14 (2) (2018)
Paul Gastin, Benjamin Monmege
A unifying survey on weighted logics and weighted automata - Core weighted logic: minimal and versatile specification of quantitative properties. Soft Comput. 22 (4) (2018)
S. Akshay, Paul Gastin, Shankara Narayanan Krishna, Ilias Sarkar
Towards an Efficient Tree Automata based technique for Timed Systems. CoRR (2017)
S. Akshay, Paul Gastin, Shankara Narayanan Krishna, Ilias Sarkar
Towards an Efficient Tree Automata Based Technique for Timed Systems. CONCUR (2017)
Benedikt Bollig, Marie Fortin, Paul Gastin
Communicating Finite-State Machines and Two-Variable Logic. CoRR (2017)
Marie Fortin, Paul Gastin
Verification of Parameterized Communicating Automata via Split-Width. FoSSaCS (2016)
S. Akshay, Paul Gastin, Shankara Narayanan Krishna
Analyzing Timed Systems Using Tree Automata. CONCUR (2016)
C. Aiswarya, Paul Gastin, Prakash Saivasan
Nested Words for Order-2 Pushdown Systems. CoRR (2016)
S. Akshay, Paul Gastin, Shankara Narayanan Krishna
Analyzing Timed Systems Using Tree Automata. CoRR (2016)
C. Aiswarya, Benedikt Bollig, Paul Gastin
An Automata-Theoretic Approach to the Verification of Distributed Algorithms. CoRR (2015)
C. Aiswarya, Benedikt Bollig, Paul Gastin
An Automata-Theoretic Approach to the Verification of Distributed Algorithms. CONCUR (2015)
S. Akshay, Paul Gastin, Madhavan Mukund, K. Narayan Kumar
Checking conformance for time-constrained scenario-based specifications. Theor. Comput. Sci. 594 (2015)
Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun
Pebble Weighted Automata and Weighted Logics. ACM Trans. Comput. Log. 15 (2) (2014)
Benedikt Bollig, Paul Gastin, Jana Schubert
Parameterized Verification of Communicating Automata under Context Bounds. RP (2014)
C. Aiswarya, Paul Gastin, K. Narayan Kumar
Verifying Communicating Multi-pushdown Systems via Split-Width. ATVA (2014)
Paul Gastin, Benjamin Monmege
Adding pebbles to weighted automata: Easy specification & efficient evaluation. Theor. Comput. Sci. 534 (2014)
Benedikt Bollig, C. Aiswarya, Paul Gastin, Marc Zeitoun
Temporal logics for concurrent recursive programs: Satisfiability and model checking. J. Appl. Log. 12 (4) (2014)
S. Akshay, Benedikt Bollig, Paul Gastin, Madhavan Mukund, K. Narayan Kumar
Distributed Timed Automata with Independently Evolving Clocks. Fundam. Informaticae 130 (4) (2014)
Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun
Logical characterization of weighted pebble walking automata. CSL-LICS (2014)
C. Aiswarya, Paul Gastin
Reasoning About Distributed Systems: WYSIWYG (Invited Talk). FSTTCS (2014)
Benedikt Bollig, Paul Gastin, Akshay Kumar
Parameterized Communicating Automata: Complementation and Model Checking. FSTTCS (2014)
C. Aiswarya, Paul Gastin, K. Narayan Kumar
Controllers for the Verification of Communicating Multi-pushdown Systems. CONCUR (2014)
S. Akshay, Benedikt Bollig, Paul Gastin
Event clock message passing automata: a logical characterization and an emptiness checking algorithm. Formal Methods Syst. Des. 42 (3) (2013)
Benedikt Bollig, Paul Gastin, Benjamin Monmege
Weighted Specifications over Nested Words. FoSSaCS (2013)
Paul Gastin, Nathalie Sznajder
Fair Synthesis for Asynchronous Distributed Systems. ACM Trans. Comput. Log. 14 (2) (2013)
Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun
A Probabilistic Kleene Theorem. ATVA (2012)
Benedikt Bollig, Aiswarya Cyriac, Paul Gastin, K. Narayan Kumar
Model Checking Languages of Data Words. FoSSaCS (2012)
Paul Gastin, Benjamin Monmege
Adding Pebbles to Weighted Automata. CIAA (2012)
Aiswarya Cyriac, Paul Gastin, K. Narayan Kumar
MSO Decidability of Multi-Pushdown Systems via Split-Width. CONCUR (2012)
Paul Gastin, Nathalie Sznajder
Decidability of well-connectedness for distributed synthesis. Inf. Process. Lett. 112 (24) (2012)
Benedikt Bollig, Aiswarya Cyriac, Paul Gastin, Marc Zeitoun
Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking. MFCS (2011)
Paul Gastin, Dietrich Kuske
Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces. Inf. Comput. 208 (7) (2010)
Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun
Pebble Weighted Automata and Transitive Closure Logics. ICALP (2) (2010)
Christel Baier, Manfred Droste, Paul Gastin, Kim Guldstrand Larsen
10031 Abstracts Collection - Quantitative Models: Expressiveness and Analysis. Quantitative Models: Expressiveness and Analysis (2010)
S. Akshay, Paul Gastin, Madhavan Mukund, K. Narayan Kumar
Model checking time-constrained scenario-based specifications. FSTTCS (2010)
Christel Baier, Manfred Droste, Paul Gastin, Kim Guldstrand Larsen
10031 Executive Summary - Quantitative Models: Expressiveness and Analysis. Quantitative Models: Expressiveness and Analysis (2010)
Thomas Chatain, Paul Gastin, Nathalie Sznajder
Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems. SOFSEM (2009)
Benedikt Bollig, Paul Gastin
Weighted versus Probabilistic Logics. Developments in Language Theory (2009)
Paul Gastin, Nathalie Sznajder, Marc Zeitoun
Distributed synthesis for well-connected architectures. Formal Methods Syst. Des. 34 (3) (2009)
Volker Diekert, Paul Gastin
First-order definable languages. Logic and Automata (2008)
Manfred Droste, Paul Gastin
On Aperiodic and Star-Free Formal Power Series in Partially Commuting Variables. Theory Comput. Syst. 42 (4) (2008)
S. Akshay, Benedikt Bollig, Paul Gastin, Madhavan Mukund, K. Narayan Kumar
Distributed Timed Automata with Independently Evolving Clocks. CONCUR (2008)
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) (2008)

Paul Gastin.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Paul Gastin