| Publication | Date of Publication | Type |
|---|
| Active learning for sound negotiations | 2024-12-06 | Paper |
| Distributed controller synthesis for deadlock avoidance | 2024-06-24 | Paper |
| Model-checking linear-time properties of parametrized asynchronous shared-memory pushdown systems | 2022-08-12 | Paper |
Origin-equivalence of two-way word transducers is in PSPACE
(available as arXiv preprint) | 2022-07-21 | Paper |
On Synthesis of Resynchronizers for Transducers
(available as arXiv preprint) | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7561615 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
| scientific article; zbMATH DE number 7561335 (Why is no real title available?) | 2022-07-21 | Paper |
| The many facets of string transducers (invited talk) | 2022-07-18 | Paper |
Abstraction-based control synthesis using partial information
European Journal of Control | 2022-03-04 | Paper |
| Communicating automata | 2021-11-12 | Paper |
One-way resynchronizability of word transducers
(available as arXiv preprint) | 2021-10-18 | Paper |
scientific article; zbMATH DE number 7407779 (Why is no real title available?)
(available as arXiv preprint) | 2021-10-08 | Paper |
| scientific article; zbMATH DE number 7407779 (Why is no real title available?) | 2021-10-08 | Paper |
| Static analysis of deterministic negotiations | 2021-01-19 | Paper |
Static analysis of deterministic negotiations
(available as arXiv preprint) | 2021-01-19 | Paper |
| Untwisting two-way transducers in elementary time | 2021-01-19 | Paper |
Untwisting two-way transducers in elementary time
(available as arXiv preprint) | 2021-01-19 | Paper |
| Automated synthesis: a distributed viewpoint | 2020-11-25 | Paper |
scientific article; zbMATH DE number 7168150 (Why is no real title available?)
(available as arXiv preprint) | 2020-02-17 | Paper |
On the complementation of Büchi asynchronous cellular automata
Automata, Languages and Programming | 2019-04-29 | Paper |
Logical definability on infinite traces
Automata, Languages and Programming | 2019-03-29 | Paper |
scientific article; zbMATH DE number 7003194 (Why is no real title available?)
(available as arXiv preprint) | 2019-01-18 | Paper |
Solving trace equations using lexicographical normal forms
Automata, Languages and Programming | 2018-07-04 | Paper |
| On the decomposition of finite-valued streaming string transducers | 2018-04-19 | Paper |
| Soundness in negotiations | 2018-03-21 | Paper |
Soundness in negotiations
(available as arXiv preprint) | 2018-01-23 | Paper |
| Minimizing resources of sweeping and streaming string transducers | 2017-12-19 | Paper |
On codings of traces
STACS 95 | 2017-12-04 | Paper |
| A tour of recent results on word transducers | 2017-11-22 | Paper |
| Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable | 2017-09-12 | Paper |
| One-way definability of sweeping transducer | 2017-07-13 | Paper |
Distributed synthesis for acyclic architectures
(available as arXiv preprint) | 2017-04-25 | Paper |
Reachability for dynamic parametric processes
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Walking on data words
Theory of Computing Systems | 2017-01-18 | Paper |
A note on monitors and Büchi automata
Theoretical Aspects of Computing - ICTAC 2015 | 2016-02-25 | Paper |
Controlling loosely cooperating processes
Theoretical Computer Science | 2015-12-15 | Paper |
Two-variable logic on data trees and XML reasoning
Journal of the ACM | 2015-11-11 | Paper |
Automated synthesis of distributed controllers
Automata, Languages, and Programming | 2015-11-04 | Paper |
On Distributed Monitoring and Synthesis
Evolving Computability | 2015-10-20 | Paper |
Two-variable logic on data words
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
A quadratic construction for Zielonka automata with acyclic communication structure
Theoretical Computer Science | 2014-09-02 | Paper |
Unlimited Decidability of Distributed Synthesis with Limited Missing Knowledge
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Asynchronous Games over Tree Architectures
Automata, Languages, and Programming | 2013-08-07 | Paper |
Walking on data words
Computer Science – Theory and Applications | 2013-06-14 | Paper |
Reachability analysis of communicating pushdown systems
Logical Methods in Computer Science | 2012-10-22 | Paper |
On distributed monitoring of asynchronous systems
Logic, Language, Information and Computation | 2012-09-21 | Paper |
| Verifying recursive active documents with positive data tree rewriting | 2012-08-29 | Paper |
| Counting in trees | 2011-03-30 | Paper |
Optimal Zielonka-type construction of deterministic asynchronous automata
Automata, Languages and Programming | 2010-09-07 | Paper |
Taming Distributed Asynchronous Systems
CONCUR 2010 - Concurrency Theory | 2010-08-31 | Paper |
Analysis of Communicating Automata
Language and Automata Theory and Applications | 2010-05-26 | Paper |
Reachability analysis of communicating pushdown systems
Foundations of Software Science and Computational Structures | 2010-04-27 | Paper |
Synthesis of distributed algorithms using asynchronous automata.
Lecture Notes in Computer Science | 2010-03-30 | Paper |
High-level message sequence charts and projections.
Lecture Notes in Computer Science | 2010-03-30 | Paper |
Complementing deterministic tree-walking automata
Information Processing Letters | 2010-01-29 | Paper |
| scientific article; zbMATH DE number 5587278 (Why is no real title available?) | 2009-07-27 | Paper |
Tree Pattern Rewriting Systems
Automated Technology for Verification and Analysis | 2008-11-20 | Paper |
A lower bound on web services composition
Logical Methods in Computer Science | 2008-08-07 | Paper |
| scientific article; zbMATH DE number 5286864 (Why is no real title available?) | 2008-06-11 | Paper |
Pattern matching and membership for hierarchical message sequence charts
Theory of Computing Systems | 2008-06-06 | Paper |
| On communicating automata with bounded channels | 2008-01-02 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Foundations of Software Science and Computation Structures
Lecture Notes in Computer Science | 2007-09-28 | Paper |
Constructing Exponential-Size Deterministic Zielonka Automata
Automata, Languages and Programming | 2007-09-11 | Paper |
A Lower Bound on Web Services Composition
Foundations of Software Science and Computational Structures | 2007-09-07 | Paper |
SOLVABILITY OF EQUATIONS IN GRAPH GROUPS IS DECIDABLE
International Journal of Algebra and Computation | 2007-03-21 | Paper |
Permutation rewriting and algorithmic verification
Information and Computation | 2007-02-20 | Paper |
Active context-free games
Theory of Computing Systems | 2006-10-25 | Paper |
A Kleene theorem and model checking algorithms for existentially bounded communicating automata
Information and Computation | 2006-07-12 | Paper |
Infinite-state high-level MSCs: model-checking and realizability
Journal of Computer and System Sciences | 2006-06-30 | Paper |
Lectures on Concurrency and Petri Nets
Lecture Notes in Computer Science | 2005-12-23 | Paper |
Developments in Language Theory
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Developments in Language Theory
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science | 2005-11-10 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
AN NP-COMPLETE FRAGMENT OF LTL
International Journal of Foundations of Computer Science | 2005-08-03 | Paper |
Bounded MSC communication
Information and Computation | 2004-10-04 | Paper |
Characterizations of classes of graphs recognizable by local computations
Theory of Computing Systems | 2004-09-22 | Paper |
| scientific article; zbMATH DE number 2086239 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2086660 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2087438 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 1754619 (Why is no real title available?) | 2002-06-12 | Paper |
| scientific article; zbMATH DE number 1754631 (Why is no real title available?) | 2002-06-12 | Paper |
| scientific article; zbMATH DE number 1701776 (Why is no real title available?) | 2002-02-05 | Paper |
Computingϵ-Free NFA from Regular Expressions inO(nlog2(n)) Time
RAIRO - Theoretical Informatics and Applications | 2001-02-11 | Paper |
| scientific article; zbMATH DE number 1504828 (Why is no real title available?) | 2000-09-12 | Paper |
| scientific article; zbMATH DE number 1418329 (Why is no real title available?) | 2000-03-19 | Paper |
Solving word equations modulo partial commutations
Theoretical Computer Science | 2000-01-12 | Paper |
| scientific article; zbMATH DE number 1222566 (Why is no real title available?) | 1999-03-02 | Paper |
The code problem for traces -- improving the boundaries
Theoretical Computer Science | 1998-07-23 | Paper |
| scientific article; zbMATH DE number 1114032 (Why is no real title available?) | 1998-02-08 | Paper |
Logical definability on infinite traces
Theoretical Computer Science | 1997-02-28 | Paper |
A note on the commutative closure of star-free languages
Information Processing Letters | 1997-02-28 | Paper |
On the complementation of asynchronous cellular Büchi automata
Theoretical Computer Science | 1997-02-27 | Paper |
| scientific article; zbMATH DE number 871239 (Why is no real title available?) | 1996-08-13 | Paper |
Deterministic asynchronous automata for infinite traces
Acta Informatica | 1994-11-23 | Paper |
| scientific article; zbMATH DE number 512867 (Why is no real title available?) | 1994-03-10 | Paper |
