Paul Gastin

According to our database1, Paul Gastin
  • authored at least 103 papers between 1990 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Communicating Finite-State Machines and Two-Variable Logic.
CoRR, 2017

Towards an Efficient Tree Automata based technique for Timed Systems.
CoRR, 2017

Towards an Efficient Tree Automata Based Technique for Timed Systems.
Proceedings of the 28th International Conference on Concurrency Theory, 2017

2016
Analyzing Timed Systems Using Tree Automata.
CoRR, 2016

Nested Words for Order-2 Pushdown Systems.
CoRR, 2016

Verification of Parameterized Communicating Automata via Split-Width.
Proceedings of the Foundations of Software Science and Computation Structures, 2016

Analyzing Timed Systems Using Tree Automata.
Proceedings of the 27th International Conference on Concurrency Theory, 2016

2015
Checking conformance for time-constrained scenario-based specifications.
Theor. Comput. Sci., 2015

An Automata-Theoretic Approach to the Verification of Distributed Algorithms.
CoRR, 2015

An Automata-Theoretic Approach to the Verification of Distributed Algorithms.
Proceedings of the 26th International Conference on Concurrency Theory, 2015

2014
Pebble Weighted Automata and Weighted Logics.
ACM Trans. Comput. Log., 2014

Adding pebbles to weighted automata: Easy specification & efficient evaluation.
Theor. Comput. Sci., 2014

Temporal logics for concurrent recursive programs: Satisfiability and model checking.
J. Applied Logic, 2014

Distributed Timed Automata with Independently Evolving Clocks.
Fundam. Inform., 2014

Parameterized Verification of Communicating Automata under Context Bounds.
Proceedings of the Reachability Problems - 8th International Workshop, 2014

Reasoning About Distributed Systems: WYSIWYG (Invited Talk).
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

Parameterized Communicating Automata: Complementation and Model Checking.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

Logical characterization of weighted pebble walking automata.
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

Controllers for the Verification of Communicating Multi-pushdown Systems.
Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

Verifying Communicating Multi-pushdown Systems via Split-Width.
Proceedings of the Automated Technology for Verification and Analysis, 2014

2013
Fair Synthesis for Asynchronous Distributed Systems.
ACM Trans. Comput. Log., 2013

Event clock message passing automata: a logical characterization and an emptiness checking algorithm.
Formal Methods in System Design, 2013

Weighted Specifications over Nested Words.
Proceedings of the Foundations of Software Science and Computation Structures, 2013

2012
Decidability of well-connectedness for distributed synthesis.
Inf. Process. Lett., 2012

Adding Pebbles to Weighted Automata.
Proceedings of the Implementation and Application of Automata, 2012

Model Checking Languages of Data Words.
Proceedings of the Foundations of Software Science and Computational Structures, 2012

MSO Decidability of Multi-Pushdown Systems via Split-Width.
Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

A Probabilistic Kleene Theorem.
Proceedings of the Automated Technology for Verification and Analysis, 2012

Specification and Verification using Temporal Logics.
Modern Applications of Automata Theory, 2012

2011
Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking.
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

2010
Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces.
Inf. Comput., 2010

Pebble Weighted Automata and Transitive Closure Logics.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Model checking time-constrained scenario-based specifications.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

10031 Executive Summary - Quantitative Models: Expressiveness and Analysis.
Proceedings of the Quantitative Models: Expressiveness and Analysis, 17.01. - 22.01.2010, 2010

10031 Abstracts Collection - Quantitative Models: Expressiveness and Analysis.
Proceedings of the Quantitative Models: Expressiveness and Analysis, 17.01. - 22.01.2010, 2010

2009
Distributed synthesis for well-connected architectures.
Formal Methods in System Design, 2009

Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems.
Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

Weighted versus Probabilistic Logics.
Proceedings of the Developments in Language Theory, 13th International Conference, 2009

2008
On Aperiodic and Star-Free Formal Power Series in Partially Commuting Variables.
Theory Comput. Syst., 2008

A Survey on Small Fragments of First-Order Logic over Finite Words.
Int. J. Found. Comput. Sci., 2008

Distributed Timed Automata with Independently Evolving Clocks.
Proceedings of the CONCUR 2008 - Concurrency Theory, 19th International Conference, 2008

First-order definable languages.
Proceedings of the Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]., 2008

2007
Weighted automata and weighted logics.
Theor. Comput. Sci., 2007

Uniform Satisfiability in PSPACE for Local Temporal Logics Over Mazurkiewicz Traces.
Fundam. Inform., 2007

Timed substitutions for regular signal-event languages.
Formal Methods in System Design, 2007

Minimal Counterexample Generation for SPIN.
Proceedings of the Model Checking Software, 2007

Automata and Logics for Timed Message Sequence Charts.
Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

Local Testing of Message Sequence Charts Is Difficult.
Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

2006
From local to global temporal logics over Mazurkiewicz traces.
Theor. Comput. Sci., 2006

Pure future local temporal logics are expressively complete for Mazurkiewicz traces.
Inf. Comput., 2006

Distributed Synthesis for Well-Connected Architectures.
Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

Refinements and Abstractions of Signal-Event (Timed) Languages.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2006

Intersection of Regular Signal-Event (Timed) Languages.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2006

A Fresh Look at Testing for Asynchronous Communication.
Proceedings of the Automated Technology for Verification and Analysis, 2006

2005
Weighted Automata and Weighted Logics.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Uniform Satisfiability Problem for Local Temporal Logics over Mazurkiewicz Traces.
Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

2004
A simple process algebra based on atomic actions with resources.
Mathematical Structures in Computer Science, 2004

Local temporal logic is expressively complete for cograph dependence alphabets.
Inf. Comput., 2004

Minimization of Counterexamples in SPIN.
Proceedings of the Model Checking Software, 2004

Distributed Games and Distributed Control for Asynchronous Systems.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

Pure Future Local Temporal Logics Are Expressively Complete for Mazurkiewicz Traces.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

Distributed Games with Causal Memory Are Decidable for Series-Parallel Systems.
Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004

2003
LTL with Past and Two-Way Very-Weak Alternating Automata.
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

Local LTL with Past Constants Is Expressively Complete for Mazurkiewicz Traces.
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

Satisfiability and Model Checking for MSO-definable Temporal Logics are in PSPACE.
Proceedings of the CONCUR 2003, 2003

2002
Resource traces: a domain for processes sharing exclusive resources.
Theor. Comput. Sci., 2002

A truly concurrent semantics for a process algebra using resource pomsets.
Theor. Comput. Sci., 2002

LTL Is Expressively Complete for Mazurkiewicz Traces.
J. Comput. Syst. Sci., 2002

An Elementary Expressively Complete Temporal Logic for Mazurkiewicz Traces.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Safety and Liveness Properties for Real Traces and a Direct Translation from LTL to Monoids.
Proceedings of the Formal and Natural Computing, 2002

2001
Model Checking Systems of Replicated Processes with Spin.
Proceedings of the Model Checking Software, 2001

Local Temporal Logic is Expressively Complete for Cograph Dependence Alphabets.
Proceedings of the Logic for Programming, 2001

Avoiding State Explosion for Distributed Systems with Timestamps.
Proceedings of the FME 2001: Formal Methods for Increasing Software Productivity, 2001

Fast LTL to Büchi Automata Translation.
Proceedings of the Computer Aided Verification, 13th International Conference, 2001

2000
Asynchronous cellular automata for pomsets.
Theor. Comput. Sci., 2000

LTL Is Expressively Complete for Mazurkiewicz Traces.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

1999
The Kleene-Schützenberger Theorem for Formal Power Series in Partially Commuting Variables.
Inf. Comput., 1999

A Truly Concurrent Semantics for a Simple Parallel Programming Language.
Proceedings of the Computer Science Logic, 13th International Workshop, 1999

An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz Traces.
Proceedings of the Computer Science Logic, 13th International Workshop, 1999

1998
Characterization of the Expressive Power of Silent Transitions in Timed Automata.
Fundam. Inform., 1998

Approximating Traces.
Acta Inf., 1998

A (Non-elementary) Modular Decision Procedure for LTrL.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1997
Removing epsilon-Transitions in Timed Automata.
Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

On Recognizable and Rational Formal Power Series in Partially Commuting Variables.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1996
On the Power of Non-Observable Actions in Timed Automata.
Proceedings of the STACS 96, 1996

Asynchronous Cellular Automata for Pomsets Without Auto-concurrency.
Proceedings of the CONCUR '96, 1996

1995
Rational and Recognizable Complex Trace Languages
Inf. Comput., January, 1995

On Congruences and Partial Orders.
Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

A Domain for Concurrent Termination: A Generalization of Mazurkiewicz Traces (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

Recent Developments in Trace Theory.
Proceedings of the Developments in Language Theory II, 1995

1994
An Extension of Kleene's and Ochmanski's Theorems to Infinite Traces.
Theor. Comput. Sci., 1994

1993
The Poset of Infinitary Traces.
Theor. Comput. Sci., 1993

An Efficient Crash-tolerant Sequential Traversal.
Parallel Processing Letters, 1993

1992
Decidability of the Star Problem in A* x {b}*.
Inf. Process. Lett., 1992

Poset Properties of Complex Traces.
Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

Asynchronous Cellular Automata for Infinite Traces.
Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

A survey of recognizable languages with infinite traces.
Proceedings of the Advances in Petri Nets 1992, The DEMON Project, 1992

1991
Recognizable and Rational Languages of Finite and Infinite Traces.
Proceedings of the STACS 91, 1991

Recognizable Complex Trace Languages.
Proceedings of the Mathematical Foundations of Computer Science 1991, 1991

A Kleene Theorem for Infinite Trace Languages.
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

1990
Un Modèle Asynchrone pour les Systèmes Distribués.
Theor. Comput. Sci., 1990

A Linear Fault-Tolerant Naming Algorithm.
Proceedings of the Distributed Algorithms, 4th International Workshop, 1990

Infinite Traces.
Proceedings of the Semantics of Systems of Concurrent Processes, 1990


  Loading...