Paul Gastin

176 papers A* 13A 4B 43C 4Journal 77Unranked 30
YearRankTypeTitle / Venue / Authors
2026 — conf
TEMPORA: Efficient Verification of Metric Temporal Properties with Past in Pointwise Semantics.
TACAS (1)
S. Akshay, Prerak Contractor, Paul Gastin, R. Govind, B. Srivathsan
2025 B conf
Characterizations of Fragments of Temporal Logic over Mazurkiewicz Traces.
CONCUR
Bharat Adsul, Paul Gastin, Shantanu Kulkarni
2025 J jnl
Efficient Verification of Metric Temporal Properties with Past in Pointwise Semantics.
CoRR
S. Akshay, Prerak Contractor, Paul Gastin, R. Govind, B. Srivathsan
2025 B conf
High-Level Message Sequence Charts: Satisfiability and Realizability Revisited.
Petri Nets
Benedikt Bollig, Marie Fortin, Paul Gastin
2025 J jnl
High-Level Message Sequence Charts: Satisfiability and Realizability Revisited.
CoRR
Benedikt Bollig, Marie Fortin, Paul Gastin
2025 B conf
Reversible Pebble Transducers.
CONCUR
Luc Dartois, Paul Gastin, Loïc Germerie Guizouarn, Shankaranarayanan Krishna
2025 J jnl
Reversible Pebble Transducers.
CoRR
Luc Dartois, Paul Gastin, Loïc Germerie Guizouarn, Shankaranarayanan Krishna
2025 J jnl
Special issue on 10th international workshop Weighted Automata: Theory and Applications (WATA 2020).
Inf. Comput.
Manfred Droste, Paul Gastin, Benjamin Monmege
2024 A* conf
An expressively complete local past propositional dynamic logic over Mazurkiewicz traces and its applications.
LICS
Bharat Adsul, Paul Gastin, Shantanu Kulkarni, Pascal Weil
2024 B conf
MITL Model Checking via Generalized Timed Automata and a New Liveness Algorithm.
CONCUR
S. Akshay, Paul Gastin, R. Govind, B. Srivathsan
2024 J jnl
MITL Model Checking via Generalized Timed Automata and a New Liveness Algorithm.
CoRR
S. Akshay, Paul Gastin, R. Govind, B. Srivathsan
2024 J jnl
Propositional dynamic logic and asynchronous cascade decompositions for regular trace languages.
CoRR
Bharat Adsul, Paul Gastin, Shantanu Kulkarni, Pascal Weil
2024 B conf
Reversible Transducers over Infinite Words.
CONCUR
Luc Dartois, Paul Gastin, Loïc Germerie Guizouarn, R. Govind, Shankaranarayanan Krishna
2024 J jnl
Reversible Transducers over Infinite Words.
CoRR
Luc Dartois, Paul Gastin, Loïc Germerie Guizouarn, R. Govind, Shankaranarayanan Krishna
2024 J jnl
Simulations for Event-Clock Automata.
Log. Methods Comput. Sci.
S. Akshay, Paul Gastin, R. Govind, B. Srivathsan
2023 — conf
A Unified Model for Real-Time Systems: Symbolic Techniques and Implementation.
CAV (1)
S. Akshay, Paul Gastin, R. Govind, Aniruddha R. Joshi, B. Srivathsan
2023 J jnl
A Unified Model for Real-Time Systems: Symbolic Techniques and Implementation.
CoRR
S. Akshay, Paul Gastin, R. Govind, Aniruddha R. Joshi, B. Srivathsan
2022 J jnl
Asynchronous wreath product and cascade decompositions for concurrent behaviours.
Log. Methods Comput. Sci.
Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil
2022 B conf
CONCUR Test-Of-Time Award 2022 (Invited Paper).
CONCUR
Ilaria Castellani, Paul Gastin, Orna Kupferman, Mickael Randour, Davide Sangiorgi
2022 A* conf
Efficient Construction of Reversible Transducers from Regular Transducer Expressions.
LICS
Luc Dartois, Paul Gastin, R. Govind, Shankara Narayanan Krishna
2022 J jnl
Efficient Construction of Reversible Transducers from Regular Transducer Expressions.
CoRR
Luc Dartois, Paul Gastin, R. Govind, Shankara Narayanan Krishna
2022 B conf
Propositional Dynamic Logic and Asynchronous Cascade Decompositions for Regular Trace Languages.
CONCUR
Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil
2022 J jnl
Regular transducer expressions for regular transformations.
Inf. Comput.
Vrunda Dave, Paul Gastin, Shankara Narayanan Krishna
2022 B conf
Simulations for Event-Clock Automata.
CONCUR
S. Akshay, Paul Gastin, R. Govind, B. Srivathsan
2022 J jnl
Simulations for Event-Clock Automata.
CoRR
S. Akshay, Paul Gastin, R. Govind, B. Srivathsan
2022 — conf
Zone-Based Verification of Timed Automata: Extrapolations, Simulations and What Next?
FORMATS
Patricia Bouyer, Paul Gastin, Frédéric Herbreteau, Ocan Sankur, B. Srivathsan
2022 J jnl
Zone-based verification of timed automata: extrapolations, simulations and what next?
CoRR
Patricia Bouyer, Paul Gastin, Frédéric Herbreteau, Ocan Sankur, B. Srivathsan
2021 J jnl
Asynchronous wreath product and cascade decompositions for concurrent behaviours.
CoRR
Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil
2021 J jnl
Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic.
J. Comput. Syst. Sci.
Benedikt Bollig, Marie Fortin, Paul Gastin
2021 — conf
Fast Zone-Based Algorithms for Reachability in Pushdown Timed Automata.
CAV (1)
S. Akshay, Paul Gastin, Karthik R. Prakash
2021 J jnl
Fast zone-based algorithms for reachability in pushdown timed automata.
CoRR
S. Akshay, Paul Gastin, Karthik R. Prakash
2021 J jnl
Reversible Regular Languages: Logical and Algebraic Characterisations.
Fundam. Informaticae
Paul Gastin, Amaldev Manuel, R. Govind
2021 A* conf
SD-Regular Transducer Expressions for Aperiodic Transformations.
LICS
Luc Dartois, Paul Gastin, Shankara Narayanan Krishna
2021 J jnl
SD-Regular Transducer Expressions for Aperiodic Transformations.
CoRR
Luc Dartois, Paul Gastin, Shankara Narayanan Krishna
2020 — conf
Reachability for Updatable Timed Automata Made Faster and More Effective.
FSTTCS
Paul Gastin, Sayan Mukherjee, B. Srivathsan
2020 J jnl
Reachability for Updatable Timed Automata made faster and more effective.
CoRR
Paul Gastin, Sayan Mukherjee, B. Srivathsan
2020 B conf
Register Transducers Are Marble Transducers.
MFCS
Gaëtan Douéneau-Tabot, Emmanuel Filiot, Paul Gastin
2020 J jnl
Register transducers are marble transducers.
CoRR
Gaëtan Douéneau-Tabot, Emmanuel Filiot, Paul Gastin
2020 — conf
Revisiting Underapproximate Reachability for Multipushdown Systems.
TACAS (1)
S. Akshay, Paul Gastin, S. Krishna, Sparsa Roychowdhury
2020 J jnl
Revisiting Underapproximate Reachability for Multipushdown Systems.
CoRR
S. Akshay, Paul Gastin, S. Krishna, Sparsa Roychowdhury
2020 — conf
Weighted Tiling Systems for Graphs: Evaluation Complexity.
FSTTCS
C. Aiswarya, Paul Gastin
2020 J jnl
Weighted Tiling Systems for Graphs: Evaluation Complexity.
CoRR
C. Aiswarya, Paul Gastin
2020 B conf
Wreath/Cascade Products and Related Decomposition Results for the Concurrent Setting of Mazurkiewicz Traces.
CONCUR
Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil
2020 J jnl
Wreath/cascade products and related decomposition results for the concurrent setting of Mazurkiewicz traces (extended version).
CoRR
Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil
2019 — ed.
39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2019, Bombay, India, December 11-13, 2019
FSTTCS
Arkadev Chattopadhyay, Paul Gastin
2019 B conf
Aperiodic Weighted Automata and Weighted First-Order Logic.
MFCS
Manfred Droste, Paul Gastin
2019 J jnl
Aperiodic Weighted Automata and Weighted First-Order Logic.
CoRR
Manfred Droste, Paul Gastin
2019 — conf
Fast Algorithms for Handling Diagonal Constraints in Timed Automata.
CAV (1)
Paul Gastin, Sayan Mukherjee, B. Srivathsan
2019 J jnl
Fast algorithms for handling diagonal constraints in timed automata.
CoRR
Paul Gastin, Sayan Mukherjee, B. Srivathsan
2019 C conf
Logics for Reversible Regular Languages and Semigroups with Involution.
DLT
Paul Gastin, Amaldev Manuel, R. Govind
2019 J jnl
Logics for Reversible Regular Languages and Semigroups with Involution.
CoRR
Paul Gastin, Amaldev Manuel, R. Govind
2019 — conf
Modular Descriptions of Regular Functions.
CAI
Paul Gastin
2019 J jnl
Modular Descriptions of Regular Functions.
CoRR
Paul Gastin
2019 J jnl
Non-Sequential Theory of Distributed Systems.
CoRR
Benedikt Bollig, Paul Gastin
2019 A* conf
Timed Systems through the Lens of Logic.
LICS
S. Akshay, Paul Gastin, Vincent Jugé, Shankara Narayanan Krishna
2019 J jnl
Timed Systems through the Lens of Logic.
CoRR
S. Akshay, Paul Gastin, Vincent Jugé, Shankara Narayanan Krishna
2018 J jnl
A unifying survey on weighted logics and weighted automata - Core weighted logic: minimal and versatile specification of quantitative properties.
Soft Comput.
Paul Gastin, Benjamin Monmege
2018 J jnl
An automata-theoretic approach to the verification of distributed algorithms.
Inf. Comput.
C. Aiswarya, Benedikt Bollig, Paul Gastin
2018 J jnl
Analyzing Timed Systems Using Tree Automata.
Log. Methods Comput. Sci.
S. Akshay, Paul Gastin, Shankara Narayanan Krishna
2018 A conf
Communicating Finite-State Machines and Two-Variable Logic.
STACS
Benedikt Bollig, Marie Fortin, Paul Gastin
2018 J jnl
Gossiping in Message-Passing Systems.
CoRR
Benedikt Bollig, Marie Fortin, Paul Gastin
2018 B conf
It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with "Happened Before".
CONCUR
Benedikt Bollig, Marie Fortin, Paul Gastin
2018 J jnl
It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with "Happened Before".
CoRR
Benedikt Bollig, Marie Fortin, Paul Gastin
2018 B conf
Reachability in Timed Automata with Diagonal Constraints.
CONCUR
Paul Gastin, Sayan Mukherjee, B. Srivathsan
2018 J jnl
Reachability in timed automata with diagonal constraints.
CoRR
Paul Gastin, Sayan Mukherjee, B. Srivathsan
2018 A* conf
Regular Transducer Expressions for Regular Transformations.
LICS
Vrunda Dave, Paul Gastin, Shankara Narayanan Krishna
2018 J jnl
Regular Transducer Expressions for Regular Transformations.
CoRR
Vrunda Dave, Paul Gastin, Shankara Narayanan Krishna
2018 J jnl
Unambiguous Forest Factorization.
CoRR
Paul Gastin, Shankara Narayanan Krishna
2017 J jnl
Communicating Finite-State Machines and Two-Variable Logic.
CoRR
Benedikt Bollig, Marie Fortin, Paul Gastin
2017 B conf
Towards an Efficient Tree Automata Based Technique for Timed Systems.
CONCUR
S. Akshay, Paul Gastin, Shankara Narayanan Krishna, Ilias Sarkar
2017 J jnl
Towards an Efficient Tree Automata based technique for Timed Systems.
CoRR
S. Akshay, Paul Gastin, Shankara Narayanan Krishna, Ilias Sarkar
2016 B conf
Analyzing Timed Systems Using Tree Automata.
CONCUR
S. Akshay, Paul Gastin, Shankara Narayanan Krishna
2016 J jnl
Analyzing Timed Systems Using Tree Automata.
CoRR
S. Akshay, Paul Gastin, Shankara Narayanan Krishna
2016 J jnl
Nested Words for Order-2 Pushdown Systems.
CoRR
C. Aiswarya, Paul Gastin, Prakash Saivasan
2016 B conf
Verification of Parameterized Communicating Automata via Split-Width.
FoSSaCS
Marie Fortin, Paul Gastin
2015 B conf
An Automata-Theoretic Approach to the Verification of Distributed Algorithms.
CONCUR
C. Aiswarya, Benedikt Bollig, Paul Gastin
2015 J jnl
An Automata-Theoretic Approach to the Verification of Distributed Algorithms.
CoRR
C. Aiswarya, Benedikt Bollig, Paul Gastin
2015 J jnl
Checking conformance for time-constrained scenario-based specifications.
Theor. Comput. Sci.
S. Akshay, Paul Gastin, Madhavan Mukund, K. Narayan Kumar
2014 J jnl
Adding pebbles to weighted automata: Easy specification & efficient evaluation.
Theor. Comput. Sci.
Paul Gastin, Benjamin Monmege
2014 B conf
Controllers for the Verification of Communicating Multi-pushdown Systems.
CONCUR
C. Aiswarya, Paul Gastin, K. Narayan Kumar
2014 J jnl
Distributed Timed Automata with Independently Evolving Clocks.
Fundam. Informaticae
S. Akshay, Benedikt Bollig, Paul Gastin, Madhavan Mukund, K. Narayan Kumar
2014 — conf
Logical characterization of weighted pebble walking automata.
CSL-LICS
Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun
2014 — conf
Parameterized Communicating Automata: Complementation and Model Checking.
FSTTCS
Benedikt Bollig, Paul Gastin, Akshay Kumar
2014 — conf
Parameterized Verification of Communicating Automata under Context Bounds.
RP
Benedikt Bollig, Paul Gastin, Jana Schubert
2014 J jnl
Pebble Weighted Automata and Weighted Logics.
ACM Trans. Comput. Log.
Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun
2014 — conf
Reasoning About Distributed Systems: WYSIWYG (Invited Talk).
FSTTCS
C. Aiswarya, Paul Gastin
2014 J jnl
Temporal logics for concurrent recursive programs: Satisfiability and model checking.
J. Appl. Log.
Benedikt Bollig, C. Aiswarya, Paul Gastin, Marc Zeitoun
2014 B conf
Verifying Communicating Multi-pushdown Systems via Split-Width.
ATVA
C. Aiswarya, Paul Gastin, K. Narayan Kumar
2013 J jnl
Event clock message passing automata: a logical characterization and an emptiness checking algorithm.
Formal Methods Syst. Des.
S. Akshay, Benedikt Bollig, Paul Gastin
2013 J jnl
Fair Synthesis for Asynchronous Distributed Systems.
ACM Trans. Comput. Log.
Paul Gastin, Nathalie Sznajder
2013 B conf
Weighted Specifications over Nested Words.
FoSSaCS
Benedikt Bollig, Paul Gastin, Benjamin Monmege
2012 B conf
A Probabilistic Kleene Theorem.
ATVA
Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun
2012 C conf
Adding Pebbles to Weighted Automata.
CIAA
Paul Gastin, Benjamin Monmege
2012 J jnl
Decidability of well-connectedness for distributed synthesis.
Inf. Process. Lett.
Paul Gastin, Nathalie Sznajder
2012 B conf
MSO Decidability of Multi-Pushdown Systems via Split-Width.
CONCUR
Aiswarya Cyriac, Paul Gastin, K. Narayan Kumar
2012 B conf
Model Checking Languages of Data Words.
FoSSaCS
Benedikt Bollig, Aiswarya Cyriac, Paul Gastin, K. Narayan Kumar
2012 — ch.
Specification and Verification using Temporal Logics.
Modern Applications of Automata Theory
Stéphane Demri, Paul Gastin
2011 B conf
Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking.
MFCS
Benedikt Bollig, Aiswarya Cyriac, Paul Gastin, Marc Zeitoun
2010 — conf
10031 Abstracts Collection - Quantitative Models: Expressiveness and Analysis.
Quantitative Models: Expressiveness and Analysis
Christel Baier, Manfred Droste, Paul Gastin, Kim Guldstrand Larsen
2010 — conf
10031 Executive Summary - Quantitative Models: Expressiveness and Analysis.
Quantitative Models: Expressiveness and Analysis
Christel Baier, Manfred Droste, Paul Gastin, Kim Guldstrand Larsen
2010 B ed.
CONCUR 2010 - Concurrency Theory, 21th International Conference, CONCUR 2010, Paris, France, August 31-September 3, 2010. Proceedings
CONCUR
Paul Gastin, François Laroussinie
2010 — conf
Model checking time-constrained scenario-based specifications.
FSTTCS
S. Akshay, Paul Gastin, Madhavan Mukund, K. Narayan Kumar
2010 — conf
Pebble Weighted Automata and Transitive Closure Logics.
ICALP (2)
Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun
2010 — ed.
Quantitative Models: Expressiveness and Analysis, 17.01. - 22.01.2010
Quantitative Models: Expressiveness and Analysis
Christel Baier, Manfred Droste, Paul Gastin, Kim Guldstrand Larsen
2010 J jnl
Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces.
Inf. Comput.
Paul Gastin, Dietrich Kuske
2009 J jnl
Distributed synthesis for well-connected architectures.
Formal Methods Syst. Des.
Paul Gastin, Nathalie Sznajder, Marc Zeitoun
2009 B conf
Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems.
SOFSEM
Thomas Chatain, Paul Gastin, Nathalie Sznajder
2009 C conf
Weighted versus Probabilistic Logics.
Developments in Language Theory
Benedikt Bollig, Paul Gastin
2008 J jnl
A Survey on Small Fragments of First-Order Logic over Finite Words.
Int. J. Found. Comput. Sci.
Volker Diekert, Paul Gastin, Manfred Kufleitner
2008 B conf
Distributed Timed Automata with Independently Evolving Clocks.
CONCUR
S. Akshay, Benedikt Bollig, Paul Gastin, Madhavan Mukund, K. Narayan Kumar
2008 — conf
First-order definable languages.
Logic and Automata
Volker Diekert, Paul Gastin
2008 J jnl
On Aperiodic and Star-Free Formal Power Series in Partially Commuting Variables.
Theory Comput. Syst.
Manfred Droste, Paul Gastin
2007 — conf
Automata and Logics for Timed Message Sequence Charts.
FSTTCS
S. Akshay, Benedikt Bollig, Paul Gastin
2007 B conf
Local Testing of Message Sequence Charts Is Difficult.
FCT
Puneet Bhateja, Paul Gastin, Madhavan Mukund, K. Narayan Kumar
2007 — conf
Minimal Counterexample Generation for SPIN.
SPIN
Paul Gastin, Pierre Moro
2007 J jnl
Timed substitutions for regular signal-event languages.
Formal Methods Syst. Des.
Béatrice Bérard, Paul Gastin, Antoine Petit
2007 J jnl
Uniform Satisfiability in PSPACE for Local Temporal Logics Over Mazurkiewicz Traces.
Fundam. Informaticae
Paul Gastin, Dietrich Kuske
2007 J jnl
Weighted automata and weighted logics.
Theor. Comput. Sci.
Manfred Droste, Paul Gastin
2006 B conf
A Fresh Look at Testing for Asynchronous Communication.
ATVA
Puneet Bhateja, Paul Gastin, Madhavan Mukund
2006 — conf
Distributed Synthesis for Well-Connected Architectures.
FSTTCS
Paul Gastin, Nathalie Sznajder, Marc Zeitoun
2006 J jnl
Editorial.
J. Autom. Lang. Comb.
Siva Anantharaman, Paul Gastin, Gaétan Hains, John Mullins, Michaël Rusinowitch
2006 J jnl
From local to global temporal logics over Mazurkiewicz traces.
Theor. Comput. Sci.
Volker Diekert, Paul Gastin
2006 — conf
Intersection of Regular Signal-Event (Timed) Languages.
FORMATS
Béatrice Bérard, Paul Gastin, Antoine Petit
2006 J jnl
Pure future local temporal logics are expressively complete for Mazurkiewicz traces.
Inf. Comput.
Volker Diekert, Paul Gastin
2006 — conf
Refinements and Abstractions of Signal-Event (Timed) Languages.
FORMATS
Béatrice Bérard, Paul Gastin, Antoine Petit
2005 B conf
Uniform Satisfiability Problem for Local Temporal Logics over Mazurkiewicz Traces.
CONCUR
Paul Gastin, Dietrich Kuske
2005 A* conf
Weighted Automata and Weighted Logics.
ICALP
Manfred Droste, Paul Gastin
2004 J jnl
A simple process algebra based on atomic actions with resources.
Math. Struct. Comput. Sci.
Paul Gastin, Michael W. Mislove
2004 B conf
Distributed Games and Distributed Control for Asynchronous Systems.
LATIN
Paul Gastin, Benjamin Lerman, Marc Zeitoun
2004 — conf
Distributed Games with Causal Memory Are Decidable for Series-Parallel Systems.
FSTTCS
Paul Gastin, Benjamin Lerman, Marc Zeitoun
2004 J jnl
Local temporal logic is expressively complete for cograph dependence alphabets.
Inf. Comput.
Volker Diekert, Paul Gastin
2004 — conf
Minimization of Counterexamples in SPIN.
SPIN
Paul Gastin, Pierre Moro, Marc Zeitoun
2004 B conf
Pure Future Local Temporal Logics Are Expressively Complete for Mazurkiewicz Traces.
LATIN
Volker Diekert, Paul Gastin
2003 B conf
LTL with Past and Two-Way Very-Weak Alternating Automata.
MFCS
Paul Gastin, Denis Oddoux
2003 B conf
Local LTL with Past Constants Is Expressively Complete for Mazurkiewicz Traces.
MFCS
Paul Gastin, Madhavan Mukund, K. Narayan Kumar
2003 B conf
Satisfiability and Model Checking for MSO-definable Temporal Logics are in PSPACE.
CONCUR
Paul Gastin, Dietrich Kuske
2002 J jnl
A truly concurrent semantics for a process algebra using resource pomsets.
Theor. Comput. Sci.
Paul Gastin, Michael W. Mislove
2002 A* conf
An Elementary Expressively Complete Temporal Logic for Mazurkiewicz Traces.
ICALP
Paul Gastin, Madhavan Mukund
2002 J jnl
Editorial.
J. Autom. Lang. Comb.
Manfred Droste, Paul Gastin
2002 J jnl
LTL Is Expressively Complete for Mazurkiewicz Traces.
J. Comput. Syst. Sci.
Volker Diekert, Paul Gastin
2002 J jnl
Resource traces: a domain for processes sharing exclusive resources.
Theor. Comput. Sci.
Paul Gastin, Dan Teodosiu
2002 — conf
Safety and Liveness Properties for Real Traces and a Direct Translation from LTL to Monoids.
Formal and Natural Computing
Volker Diekert, Paul Gastin
2001 — conf
Avoiding State Explosion for Distributed Systems with Timestamps.
FME
Fabrice Derepas, Paul Gastin, David Plainfossé
2001 A* conf
Fast LTL to Büchi Automata Translation.
CAV
Paul Gastin, Denis Oddoux
2001 B conf
Local Temporal Logic is Expressively Complete for Cograph Dependence Alphabets.
LPAR
Volker Diekert, Paul Gastin
2001 — conf
Model Checking Systems of Replicated Processes with Spin.
SPIN
Fabrice Derepas, Paul Gastin
2000 J jnl
Asynchronous cellular automata for pomsets.
Theor. Comput. Sci.
Manfred Droste, Paul Gastin, Dietrich Kuske
2000 A* conf
LTL Is Expressively Complete for Mazurkiewicz Traces.
ICALP
Volker Diekert, Paul Gastin
1999 B conf
A Truly Concurrent Semantics for a Simple Parallel Programming Language.
CSL
Paul Gastin, Michael W. Mislove
1999 B conf
An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz Traces.
CSL
Volker Diekert, Paul Gastin
1999 J jnl
The Kleene-Schützenberger Theorem for Formal Power Series in Partially Commuting Variables.
Inf. Comput.
Manfred Droste, Paul Gastin
1998 B conf
A (Non-elementary) Modular Decision Procedure for LTrL.
MFCS
Paul Gastin, Raphaël Meyer, Antoine Petit
1998 J jnl
Approximating Traces.
Acta Informatica
Volker Diekert, Paul Gastin
1998 J jnl
Characterization of the Expressive Power of Silent Transitions in Timed Automata.
Fundam. Informaticae
Béatrice Bérard, Antoine Petit, Volker Diekert, Paul Gastin
1997 A* conf
On Recognizable and Rational Formal Power Series in Partially Commuting Variables.
ICALP
Manfred Droste, Paul Gastin
1997 A conf
Removing epsilon-Transitions in Timed Automata.
STACS
Volker Diekert, Paul Gastin, Antoine Petit
1996 B conf
Asynchronous Cellular Automata for Pomsets Without Auto-concurrency.
CONCUR
Manfred Droste, Paul Gastin
1996 A conf
On the Power of Non-Observable Actions in Timed Automata.
STACS
Béatrice Bérard, Paul Gastin, Antoine Petit
1995 A* conf
A Domain for Concurrent Termination: A Generalization of Mazurkiewicz Traces (Extended Abstract).
ICALP
Volker Diekert, Paul Gastin
1995 — ch.
Infinite Traces.
The Book of Traces
Paul Gastin, Antoine Petit
1995 B conf
On Congruences and Partial Orders.
MFCS
Serge Bauget, Paul Gastin
1995 J jnl
Rational and Recognizable Complex Trace Languages
Inf. Comput.
Volker Diekert, Paul Gastin, Antoine Petit
1995 C conf
Recent Developments in Trace Theory.
Developments in Language Theory
Volker Diekert, Paul Gastin, Antoine Petit
1994 J jnl
An Extension of Kleene's and Ochmanski's Theorems to Infinite Traces.
Theor. Comput. Sci.
Paul Gastin, Antoine Petit, Wieslaw Zielonka
1993 J jnl
An Efficient Crash-tolerant Sequential Traversal.
Parallel Process. Lett.
Paul Gastin, Vincent Villain
1993 J jnl
The Poset of Infinitary Traces.
Theor. Comput. Sci.
Paul Gastin, Brigitte Rozoy
1992 — ch.
A survey of recognizable languages with infinite traces.
Advances in Petri Nets: The DEMON Project
Paul Gastin, Antoine Petit
1992 A* conf
Asynchronous Cellular Automata for Infinite Traces.
ICALP
Paul Gastin, Antoine Petit
1992 J jnl
Decidability of the Star Problem in A* x {b}*.
Inf. Process. Lett.
Paul Gastin, Edward Ochmanski, Antoine Petit, Brigitte Rozoy
1992 B conf
Poset Properties of Complex Traces.
MFCS
Paul Gastin, Antoine Petit
1991 A* conf
A Kleene Theorem for Infinite Trace Languages.
ICALP
Paul Gastin, Antoine Petit, Wieslaw Zielonka
1991 B conf
Recognizable Complex Trace Languages.
MFCS
Volker Diekert, Paul Gastin, Antoine Petit
1991 A conf
Recognizable and Rational Languages of Finite and Infinite Traces.
STACS
Paul Gastin
1990 — conf
A Linear Fault-Tolerant Naming Algorithm.
WDAG
Joffroy Beauquier, Paul Gastin, Vincent Villain
1990 — conf
Infinite Traces.
Semantics of Systems of Concurrent Processes
Paul Gastin
1990 J jnl
Un Modèle Asynchrone pour les Systèmes Distribués.
Theor. Comput. Sci.
Paul Gastin