Anca Muscholl

Grégoire Sutre

Proceedings of the 35th International Conference on Concurrency Theory, 2024

2023

Report on ICALP 2023.

[BibT_eX]

[DOI]

Bull. EATCS, 2023

ICALP 2024 - Call for Papers.

[BibT_eX]

[DOI]

Bull. EATCS, 2023

Report on ICALP 2022 - 49th EATCS International Colloquium on Automata, Languages and Programming.

[BibT_eX]

[DOI]

Bull. EATCS, 2023

Regular Transformations (Dagstuhl Seminar 23202).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2023

Model-Checking Parametric Lock-Sharing Systems Against Regular Constraints.

[BibT_eX]

[DOI]

Corto Mascle

Proceedings of the 34th International Conference on Concurrency Theory, 2023

2022

Abstraction-based control synthesis using partial information.

[BibT_eX]

[DOI]

W. Alejandro Apaza-Perez

Eur. J. Control, 2022

Report on ICALP 2021.

[BibT_eX]

[DOI]

Bull. EATCS, 2022

Active learning for sound negotiations✱.

[BibT_eX]

[DOI]

Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

Distributed Controller Synthesis for Deadlock Avoidance.

[BibT_eX]

[DOI]

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021

Pumping lemmas for weighted automata.

[BibT_eX]

[DOI]

Agnishom Chattopadhyay

Filip Mazowiecki

Shankara Narayanan Krishna

Cristian Riveros

Log. Methods Comput. Sci., 2021

One-way Resynchronizability of Word Transducers.

[BibT_eX]

[DOI]

Sougata Bose

Proceedings of the Foundations of Software Science and Computation Structures, 2021

Communicating automata.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Automata Theory., 2021

2020

Minimization of visibly pushdown automata is NP-complete.

[BibT_eX]

[DOI]

Olivier Gauwin

Michael Raskin

Log. Methods Comput. Sci., 2020

The Presburger Award 2020 - Laudatio for Dmitriy Zhuk.

[BibT_eX]

[DOI]

Bull. EATCS, 2020

Report on ICALP 2020.

[BibT_eX]

[DOI]

Artur Czumaj

Bull. EATCS, 2020

2019

The Presburger Award for Young Scientists 2020 - Call for Nominations.

[BibT_eX]

[DOI]

Thore Husfeldt

Meena Mahajan

Bull. EATCS, 2019

The Many Facets of String Transducers (Invited Talk).

[BibT_eX]

[DOI]

Shankara Narayanan Krishna

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

On Synthesis of Resynchronizers for Transducers.

[BibT_eX]

[DOI]

Sougata Bose

Vincent Penelle

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Equivalence of Finite-Valued Streaming String Transducers Is Decidable.

[BibT_eX]

[DOI]

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

Soundness in negotiations.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2018

One-way definability of two-way word transducers.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2018

Formal Methods and Fault-Tolerant Distributed Comp.: Forging an Alliance (Dagstuhl Seminar 18211).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2018

On Canonical Models for Rational Functions over Infinite Words.

[BibT_eX]

[DOI]

Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

Origin-Equivalence of Two-Way Word Transducers Is in PSPACE.

[BibT_eX]

[DOI]

Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

2017

Reachability for Dynamic Parametric Processes.

[BibT_eX]

[DOI]

Helmut Seidl

Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2017

On the Decomposition of Finite-Valued Streaming String Transducers.

[BibT_eX]

[DOI]

Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Static analysis of deterministic negotiations.

[BibT_eX]

[DOI]

Javier Esparza

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Untwisting two-way transducers in elementary time.

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Automated Synthesis: a Distributed Viewpoint.

[BibT_eX]

[DOI]

Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

A Tour of Recent Results on Word Transducers.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

Model-Checking Linear-Time Properties of Parametrized Asynchronous Shared-Memory Pushdown Systems.

[BibT_eX]

[DOI]

Marie Fortin

Proceedings of the Computer Aided Verification - 29th International Conference, 2017

2016

Controlling loosely cooperating processes.

[BibT_eX]

[DOI]

Sven Schewe

Theor. Comput. Sci., 2016

Preface of STACS 2013 Special Issue.

[BibT_eX]

[DOI]

Martin Dietzfelbinger

Theory Comput. Syst., 2016

Walking on Data Words.

[BibT_eX]

[DOI]

Amaldev Manuel

Theory Comput. Syst., 2016

ICALP 2017 - Call for Papers.

[BibT_eX]

[DOI]

Piotr Indyk

Fabian Kuhn

Bull. EATCS, 2016

On parametrized verification of asynchronous, shared-memory pushdown systems.

[BibT_eX]

[DOI]

Marie Fortin

CoRR, 2016

Minimizing Resources of Sweeping and Streaming String Transducers.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Automated Synthesis: Going Distributed.

[BibT_eX]

[DOI]

Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016

2015

A Note on Monitors and Büchi Automata.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computing - ICTAC 2015, 2015

Automated Synthesis of Distributed Controllers.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

One-way Definability of Sweeping Transducer.

[BibT_eX]

[DOI]

Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable.

[BibT_eX]

[DOI]

Salvatore La Torre

Proceedings of the 26th International Conference on Concurrency Theory, 2015

On Distributed Monitoring and Synthesis.

[BibT_eX]

[DOI]

Proceedings of the Evolving Computability - 11th Conference on Computability in Europe, 2015

2014

Distributed Synthesis for Acyclic Architectures.

[BibT_eX]

[DOI]

Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

2013

A quadratic construction for Zielonka automata with acyclic communication structure.

[BibT_eX]

[DOI]

Siddharth Krishna

Theor. Comput. Sci., 2013

Call for Nominations For EATCS - Fellows 2014.

[BibT_eX]

[DOI]

Bull. EATCS, 2013

Unlimited Decidability of Distributed Synthesis with Limited Missing Knowledge.

[BibT_eX]

[DOI]

Sven Schewe

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Recursive queries on trees and data trees.

[BibT_eX]

[DOI]

Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

Asynchronous Games over Tree Architectures.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012

Reachability Analysis of Communicating Pushdown Systems

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2012

On Injective Embeddings of Tree Patterns

[BibT_eX]

[DOI]

CoRR, 2012

On Distributed Monitoring of Asynchronous Systems.

[BibT_eX]

[DOI]

Proceedings of the Logic, Language, Information and Computation, 2012

2011

Trace Theory.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Parallel Computing, 2011

Two-variable logic on data words.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2011

2010

Analysis of Communicating Automata.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2010

Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Verifying Recursive Active Documents with Positive Data Tree Rewriting.

[BibT_eX]

[DOI]

Zhilin Wu

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

Taming Distributed Asynchronous Systems.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

2009

Two-variable logic on data trees and XML reasoning.

[BibT_eX]

[DOI]

J. ACM, 2009

2008

Pattern Matching and Membership for Hierarchical Message Sequence Charts.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2008

A Lower Bound on Web Services Composition.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2008

08171 Summary - Beyond the Finite: New Challenges in Verification and Semistructured Data.

[BibT_eX]

[DOI]

Proceedings of the Beyond the Finite: New Challenges in Verification and Semistructured Data, 20.04., 2008

08171 Abstracts Collection - Beyond the Finite: New Challenges in Verification and Semistructured Data.

[BibT_eX]

[DOI]

Proceedings of the Beyond the Finite: New Challenges in Verification and Semistructured Data, 20.04., 2008

Counting in trees.

[BibT_eX]

Helmut Seidl

Thomas Schwentick

Proceedings of the Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]., 2008

Tree Pattern Rewriting Systems.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2008

2007

Permutation rewriting and algorithmic verification.

[BibT_eX]

[DOI]

Ahmed Bouajjani

Tayssir Touili

Inf. Comput., 2007

On Communicating Automata with Bounded Channels.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2007

2006

Active Context-Free Games.

[BibT_eX]

[DOI]

Thomas Schwentick

Luc Segoufin

Theory Comput. Syst., 2006

Infinite-state high-level MSCs: Model-checking and realizability.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2006

Complementing deterministic tree-walking automata.

[BibT_eX]

[DOI]

Mathias Samuelides

Luc Segoufin

Inf. Process. Lett., 2006

Solvability of Equations in Graph Groups Is Decidable.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2006

A Kleene theorem and model checking algorithms for existentially bounded communicating automata.

[BibT_eX]

[DOI]

Inf. Comput., 2006

Two-variable logic on data trees and XML reasoning.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2006

Two-Variable Logic on Words with Data.

[BibT_eX]

[DOI]

Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 2006

Constructing Exponential-Size Deterministic Zielonka Automata.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005

An NP-complete fragment of LTL.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2005

Snapshot Verification.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2005

Message Sequence Charts: A Survey.

[BibT_eX]

[DOI]

Proceedings of the Fifth International Conference on Application of Concurrency to System Design (ACSD 2005), 2005

2004

Characterizations of Classes of Graphs Recognizable by Local Computations.

[BibT_eX]

[DOI]

Emmanuel Godard

Yves Métivier

Theory Comput. Syst., 2004

Bounded MSC communication.

[BibT_eX]

[DOI]

Markus Lohrey

Inf. Comput., 2004

Counting in Trees for Free.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Specifying and Verifying Partial Order Properties Using Template MSCs.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2004

A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 2004

2003

Compositional message sequence charts.

[BibT_eX]

[DOI]

Elsa L. Gunter

Int. J. Softw. Tools Technol. Transf., 2003

Numerical document queries.

[BibT_eX]

[DOI]

Helmut Seidl

Thomas Schwentick

Proceedings of the Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2003

Deciding Properties of Message Sequence Charts.

[BibT_eX]

[DOI]

Proceedings of the Scenarios: Models, 2003

Synthesis of Distributed Algorithms Using Asynchronous Automata.

[BibT_eX]

[DOI]

Alin Stefanescu

Javier Esparza

Proceedings of the CONCUR 2003, 2003

High-Level Message Sequence Charts and Projections.

[BibT_eX]

[DOI]

Loïc Hélouët

Proceedings of the CONCUR 2003, 2003

Message Sequence Charts.

[BibT_eX]

[DOI]

Proceedings of the Lectures on Concurrency and Petri Nets, 2003

2002

Preface.

[BibT_eX]

[DOI]

Benoît Caillaud

Proceedings of the Validation and Implementation of Scenario-based Specifications, 2002

2001

From Finite State Communication Protocols to High-Level Message Sequence Charts.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

Solvability of Equations in Free Partially Commutative Groups Is Decidable.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000

Computing epsilon-free NFA from regular expressions in O(n log<sup>2</sup>(n)) time.

[BibT_eX]

[DOI]

Christian Hagenah

RAIRO Theor. Informatics Appl., 2000

Analyzing Message Sequence Charts.

[BibT_eX]

Proceedings of the SAM 2000, 2000

1999

Solving Word Equations modulo Partial Commutations.

[BibT_eX]

[DOI]

Yuri V. Matiyasevich

Theor. Comput. Sci., 1999

Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1999, 1999

Matching Specifications for Message Sequence Charts.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structure, 1999

Decision and complexity issues on concurrent systems.

[BibT_eX]

Universität Stuttgart, 1999

1998

The Power of Local Computations in Graphs with Initial Knowledge.

[BibT_eX]

[DOI]

Emmanuel Godard

Yves Métivier

Proceedings of the Theory and Application of Graph Transformations, 1998

Computing epsilon-Free NFA from Regular Expressions in O(n log²(n)) Time.

[BibT_eX]

[DOI]

Christian Hagenah

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

Deciding Properties for Message Sequence Charts.

[BibT_eX]

[DOI]

Zhendong Su

Proceedings of the Foundations of Software Science and Computation Structure, 1998

1997

The Code Problem for Traces - Improving the Boundaries.

[BibT_eX]

[DOI]

Hendrik Jan Hoogeboom

Theor. Comput. Sci., 1997

About the local detection of termination of local computations in graphs.

[BibT_eX]

Yves Métivier

Pierre-André Wacrenier

Proceedings of the SIROCCO'97, 1997

Solving Trace Equations Using Lexicographical Normal Forms.

[BibT_eX]

[DOI]

Yuri V. Matiyasevich

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1996

On the Complementation of Asynchronous Cellular Büchi Automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

Logical Definability on Infinite Traces.

[BibT_eX]

[DOI]

Werner Ebinger

Theor. Comput. Sci., 1996

A Note on the Commutative Closure of Star-Free Languages.

[BibT_eX]

[DOI]

Holger Petersen

Inf. Process. Lett., 1996

A Note on Métivier's Construction of Asynchronous Automata for Triangulated Graphs.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1996

Code Problems on Traces.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

1995

On Codings of Traces.

[BibT_eX]

[DOI]

Klaus Reinhardt

Proceedings of the STACS 95, 1995

Construction of Asynchronous Automata.

[BibT_eX]

[DOI]

Proceedings of the Book of Traces, 1995

1994

Deterministic Asynchronous Automata for Infinite Traces.

[BibT_eX]

[DOI]

Acta Informatica, 1994

On the Complementation of Büchi Asynchronous Cellular Automata.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

Über die Erkennbarkeit unendlicher Spuren.

[BibT_eX]

[DOI]