Über die Erkennbarkeit unendlicher Spuren. - Anca Muscholl (1994)

On the Complementation of Büchi Asynchronous Cellular Automata. - Anca Muscholl (ICALP, 1994)

Deterministic Asynchronous Automata for Infinite Traces. - Volker Diekert; Anca Muscholl (Acta Informatica, 1994)

Construction of Asynchronous Automata. - Volker Diekert; Anca Muscholl (The Book of Traces, 1995)

On Codings of Traces. - Volker Diekert; Anca Muscholl; Klaus Reinhardt (STACS, 1995)

Code Problems on Traces. - Volker Diekert; Anca Muscholl (MFCS, 1996)

A Note on Métivier's Construction of Asynchronous Automata for Triangulated Graphs. - Volker Diekert; Anca Muscholl (Fundam. Informaticae, 1996)

A Note on the Commutative Closure of Star-Free Languages. - Anca Muscholl; Holger Petersen 001 (Inf. Process. Lett., 1996)

Logical Definability on Infinite Traces. - Werner Ebinger; Anca Muscholl (Theor. Comput. Sci., 1996)

On the Complementation of Asynchronous Cellular Büchi Automata. - Anca Muscholl (Theor. Comput. Sci., 1996)

Solving Trace Equations Using Lexicographical Normal Forms. - Volker Diekert; Yuri V. Matiyasevich; Anca Muscholl (ICALP, 1997)

About the local detection of termination of local computations in graphs. - Yves Métivier; Anca Muscholl; Pierre-André Wacrenier (SIROCCO, 1997)

The Code Problem for Traces - Improving the Boundaries. - Hendrik Jan Hoogeboom; Anca Muscholl (Theor. Comput. Sci., 1997)

Deciding Properties for Message Sequence Charts. - Anca Muscholl; Doron A. Peled; Zhendong Su 001 (FoSSaCS, 1998)

Computing epsilon-Free NFA from Regular Expressions in O(n log²(n)) Time. - Christian Hagenah; Anca Muscholl (MFCS, 1998)

The Power of Local Computations in Graphs with Initial Knowledge. - Emmanuel Godard; Yves Métivier; Anca Muscholl (TAGT, 1998)

Decision and complexity issues on concurrent systems. - Anca Muscholl (Universität Stuttgart, 1999)

Matching Specifications for Message Sequence Charts. - Anca Muscholl (FoSSaCS, 1999)

Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces. - Anca Muscholl; Doron A. Peled (MFCS, 1999)

Solving Word Equations modulo Partial Commutations. - Volker Diekert; Yuri V. Matiyasevich; Anca Muscholl (Theor. Comput. Sci., 1999)

Analyzing Message Sequence Charts. - Anca Muscholl; Doron A. Peled (SAM, 2000)

Computing epsilon-free NFA from regular expressions in O(n log2(n)) time. - Christian Hagenah; Anca Muscholl (RAIRO Theor. Informatics Appl., 2000)

Solvability of Equations in Free Partially Commutative Groups Is Decidable. - Volker Diekert; Anca Muscholl (ICALP, 2001)

From Finite State Communication Protocols to High-Level Message Sequence Charts. - Anca Muscholl; Doron A. Peled (ICALP, 2001)

Preface. - Benoît Caillaud; Anca Muscholl (VISS@ETAPS, 2002)

Message Sequence Charts. - Blaise Genest; Anca Muscholl; Doron A. Peled (Lectures on Concurrency and Petri Nets, 2003)

High-Level Message Sequence Charts and Projections. - Blaise Genest; Loïc Hélouët; Anca Muscholl (CONCUR, 2003)

Synthesis of Distributed Algorithms Using Asynchronous Automata. - Alin Stefanescu; Javier Esparza; Anca Muscholl (CONCUR, 2003)

Deciding Properties of Message Sequence Charts. - Anca Muscholl; Doron A. Peled (Scenarios: Models, Transformations and Tools, 2003)

Numerical document queries. - Helmut Seidl; Thomas Schwentick; Anca Muscholl (PODS, 2003)

Compositional message sequence charts. - Elsa L. Gunter; Anca Muscholl; Doron A. Peled (Int. J. Softw. Tools Technol. Transf., 2003)

A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms. - Blaise Genest; Anca Muscholl; Dietrich Kuske (Developments in Language Theory, 2004)

Specifying and Verifying Partial Order Properties Using Template MSCs. - Blaise Genest; Marius Minea; Anca Muscholl; Doron A. Peled (FoSSaCS, 2004)

Counting in Trees for Free. - Helmut Seidl; Thomas Schwentick; Anca Muscholl; Peter Habermehl (ICALP, 2004)

Bounded MSC communication. - Markus Lohrey; Anca Muscholl (Inf. Comput., 2004)

Characterizations of Classes of Graphs Recognizable by Local Computations. - Emmanuel Godard; Yves Métivier; Anca Muscholl (Theory Comput. Syst., 2004)

Message Sequence Charts: A Survey. - Blaise Genest; Anca Muscholl (ACSD, 2005)

Snapshot Verification. - Blaise Genest; Dietrich Kuske; Anca Muscholl; Doron A. Peled (TACAS, 2005)

An NP-complete fragment of LTL. - Anca Muscholl; Igor Walukiewicz (Int. J. Found. Comput. Sci., 2005)

Constructing Exponential-Size Deterministic Zielonka Automata. - Blaise Genest; Anca Muscholl (ICALP (2), 2006)

Two-Variable Logic on Words with Data. - Mikolaj Bojanczyk; Anca Muscholl; Thomas Schwentick; Luc Segoufin; Claire David (LICS, 2006)

Two-variable logic on data trees and XML reasoning. - Mikolaj Bojanczyk; Claire David; Anca Muscholl; Thomas Schwentick; Luc Segoufin (PODS, 2006)

A Kleene theorem and model checking algorithms for existentially bounded communicating automata. - Blaise Genest; Dietrich Kuske; Anca Muscholl (Inf. Comput., 2006)

Solvability of Equations in Graph Groups Is Decidable. - Volker Diekert; Anca Muscholl (Int. J. Algebra Comput., 2006)

Complementing deterministic tree-walking automata. - Anca Muscholl; Mathias Samuelides; Luc Segoufin (Inf. Process. Lett., 2006)

Infinite-state high-level MSCs: Model-checking and realizability. - Blaise Genest; Anca Muscholl; Helmut Seidl; Marc Zeitoun (J. Comput. Syst. Sci., 2006)

Active Context-Free Games. - Anca Muscholl; Thomas Schwentick; Luc Segoufin (Theory Comput. Syst., 2006)

On Communicating Automata with Bounded Channels. - Blaise Genest; Dietrich Kuske; Anca Muscholl (Fundam. Informaticae, 2007)

Permutation rewriting and algorithmic verification. - Ahmed Bouajjani; Anca Muscholl; Tayssir Touili (Inf. Comput., 2007)

Tree Pattern Rewriting Systems. - Blaise Genest; Anca Muscholl; Olivier Serre; Marc Zeitoun (ATVA, 2008)

Counting in trees. - Helmut Seidl; Thomas Schwentick; Anca Muscholl (Logic and Automata, 2008)

08171 Abstracts Collection - Beyond the Finite: New Challenges in Verification and Semistructured Data. - Anca Muscholl; Ramaswamy Ramanujam; Michaël Rusinowitch; Thomas Schwentick; Victor Vianu (Beyond the Finite: New Challenges in Verification and Semistructured Data, 2008)

08171 Summary - Beyond the Finite: New Challenges in Verification and Semistructured Data. - Anca Muscholl; Ramaswamy Ramanujam; Michaël Rusinowitch; Thomas Schwentick; Victor Vianu (Beyond the Finite: New Challenges in Verification and Semistructured Data, 2008)

A Lower Bound on Web Services Composition. - Anca Muscholl; Igor Walukiewicz (Log. Methods Comput. Sci., 2008)

Pattern Matching and Membership for Hierarchical Message Sequence Charts. - Blaise Genest; Anca Muscholl (Theory Comput. Syst., 2008)

Two-variable logic on data trees and XML reasoning. - Mikolaj Bojanczyk; Anca Muscholl; Thomas Schwentick; Luc Segoufin (J. ACM, 2009)

Taming Distributed Asynchronous Systems. - Anca Muscholl (CONCUR, 2010)

Verifying Recursive Active Documents with Positive Data Tree Rewriting. - Blaise Genest; Anca Muscholl; Zhilin Wu (FSTTCS, 2010)

Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata. - Blaise Genest; Hugo Gimbert; Anca Muscholl; Igor Walukiewicz (ICALP (2), 2010)

Analysis of Communicating Automata. - Anca Muscholl (LATA, 2010)

Two-variable logic on data words. - Mikolaj Bojanczyk; Claire David; Anca Muscholl; Thomas Schwentick; Luc Segoufin (ACM Trans. Comput. Log., 2011)

Trace Theory. - Volker Diekert; Anca Muscholl (Encyclopedia of Parallel Computing, 2011)

On Distributed Monitoring of Asynchronous Systems. - Volker Diekert; Anca Muscholl (WoLLIC, 2012)

On Injective Embeddings of Tree Patterns - Jakub Michaliszyn; Anca Muscholl; Slawek Staworko; Piotr Wieczorek; Zhilin Wu (CoRR, 2012)

Reachability Analysis of Communicating Pushdown Systems - Alexander Heußner; Jérôme Leroux; Anca Muscholl; Grégoire Sutre (Log. Methods Comput. Sci., 2012)

Asynchronous Games over Tree Architectures. - Blaise Genest; Hugo Gimbert; Anca Muscholl; Igor Walukiewicz (ICALP (2), 2013)

Recursive queries on trees and data trees. - Serge Abiteboul; Pierre Bourhis; Anca Muscholl; Zhilin Wu (ICDT, 2013)

Unlimited Decidability of Distributed Synthesis with Limited Missing Knowledge. - Anca Muscholl; Sven Schewe (MFCS, 2013)

Call for Nominations For EATCS - Fellows 2014. - Anca Muscholl (Bull. EATCS, 2013)

A quadratic construction for Zielonka automata with acyclic communication structure. - Siddharth Krishna 001; Anca Muscholl (Theor. Comput. Sci., 2013)

Distributed Synthesis for Acyclic Architectures. - Anca Muscholl; Igor Walukiewicz (FSTTCS, 2014)

On Distributed Monitoring and Synthesis. - Anca Muscholl (CiE, 2015)

Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable. - Salvatore La Torre; Anca Muscholl; Igor Walukiewicz (CONCUR, 2015)

One-way Definability of Sweeping Transducer. - Félix Baschenis; Olivier Gauwin; Anca Muscholl; Gabriele Puppis (FSTTCS, 2015)

Automated Synthesis of Distributed Controllers. - Anca Muscholl (ICALP (2), 2015)

A Note on Monitors and Büchi Automata. - Volker Diekert; Anca Muscholl; Igor Walukiewicz (ICTAC, 2015)

Automated Synthesis: Going Distributed. - Anca Muscholl (CSL, 2016)

Minimizing Resources of Sweeping and Streaming String Transducers. - Félix Baschenis; Olivier Gauwin; Anca Muscholl; Gabriele Puppis (ICALP, 2016)

On parametrized verification of asynchronous, shared-memory pushdown systems. - Marie Fortin; Anca Muscholl; Igor Walukiewicz (CoRR, 2016)

ICALP 2017 - Call for Papers. - Piotr Indyk; Anca Muscholl; Fabian Kuhn (Bull. EATCS, 2016)

Walking on Data Words. - Amaldev Manuel; Anca Muscholl; Gabriele Puppis (Theory Comput. Syst., 2016)

Preface of STACS 2013 Special Issue. - Anca Muscholl; Martin Dietzfelbinger (Theory Comput. Syst., 2016)

Controlling loosely cooperating processes. - Anca Muscholl; Sven Schewe (Theor. Comput. Sci., 2016)

Model-Checking Linear-Time Properties of Parametrized Asynchronous Shared-Memory Pushdown Systems. - Marie Fortin; Anca Muscholl; Igor Walukiewicz (CAV (2), 2017)

A Tour of Recent Results on Word Transducers. - Anca Muscholl (FCT, 2017)

Automated Synthesis: a Distributed Viewpoint. - Anca Muscholl (FSTTCS, 2017)

Untwisting two-way transducers in elementary time. - Félix Baschenis; Olivier Gauwin; Anca Muscholl; Gabriele Puppis (LICS, 2017)

Static analysis of deterministic negotiations. - Javier Esparza; Anca Muscholl; Igor Walukiewicz (LICS, 2017)

On the Decomposition of Finite-Valued Streaming String Transducers. - Paul Gallot; Anca Muscholl; Gabriele Puppis; Sylvain Salvati (STACS, 2017)

Reachability for Dynamic Parametric Processes. - Anca Muscholl; Helmut Seidl; Igor Walukiewicz (VMCAI, 2017)

Origin-Equivalence of Two-Way Word Transducers Is in PSPACE. - Sougata Bose; Anca Muscholl; Vincent Penelle; Gabriele Puppis (FSTTCS, 2018)

On Canonical Models for Rational Functions over Infinite Words. - Emmanuel Filiot; Olivier Gauwin; Nathan Lhote; Anca Muscholl (FSTTCS, 2018)

Formal Methods and Fault-Tolerant Distributed Comp.: Forging an Alliance (Dagstuhl Seminar 18211). - Javier Esparza; Pierre Fraigniaud; Anca Muscholl; Sergio Rajsbaum (Dagstuhl Reports, 2018)

One-way definability of two-way word transducers. - Félix Baschenis; Olivier Gauwin; Anca Muscholl; Gabriele Puppis (Log. Methods Comput. Sci., 2018)

Soundness in negotiations. - Javier Esparza; Denis Kuperberg; Anca Muscholl; Igor Walukiewicz (Log. Methods Comput. Sci., 2018)

Equivalence of Finite-Valued Streaming String Transducers Is Decidable. - Anca Muscholl; Gabriele Puppis (ICALP, 2019)

On Synthesis of Resynchronizers for Transducers. - Sougata Bose; Shankara Narayanan Krishna; Anca Muscholl; Vincent Penelle; Gabriele Puppis (MFCS, 2019)

The Many Facets of String Transducers (Invited Talk). - Anca Muscholl; Gabriele Puppis (STACS, 2019)

The Presburger Award for Young Scientists 2020 - Call for Nominations. - Thore Husfeldt; Meena Mahajan; Anca Muscholl (Bull. EATCS, 2019)

Report on ICALP 2020. - Artur Czumaj; Anca Muscholl (Bull. EATCS, 2020)

The Presburger Award 2020 - Laudatio for Dmitriy Zhuk. - Anca Muscholl (Bull. EATCS, 2020)

Minimization of visibly pushdown automata is NP-complete. - Olivier Gauwin; Anca Muscholl; Michael Raskin (Log. Methods Comput. Sci., 2020)

Communicating automata. - Dietrich Kuske; Anca Muscholl (Handbook of Automata Theory (II.), 2021)

One-way Resynchronizability of Word Transducers. - Sougata Bose; Shankara Narayanan Krishna; Anca Muscholl; Gabriele Puppis (FoSSaCS, 2021)

Pumping lemmas for weighted automata. - Agnishom Chattopadhyay; Filip Mazowiecki; Anca Muscholl; Cristian Riveros (Log. Methods Comput. Sci., 2021)

Distributed Controller Synthesis for Deadlock Avoidance. - Hugo Gimbert; Corto Mascle; Anca Muscholl; Igor Walukiewicz (ICALP, 2022)

Active learning for sound negotiations✱. - Anca Muscholl; Igor Walukiewicz (LICS, 2022)

Report on ICALP 2021. - Anca Muscholl (Bull. EATCS, 2022)

Abstraction-based control synthesis using partial information. - W. Alejandro Apaza-Perez; Christophe Combastel; Igor Walukiewicz; Anca Muscholl; Ali Zolghadri (Eur. J. Control, 2022)

Model-Checking Parametric Lock-Sharing Systems Against Regular Constraints. - Corto Mascle; Anca Muscholl; Igor Walukiewicz (CONCUR, 2023)

Regular Transformations (Dagstuhl Seminar 23202). - Rajeev Alur; Mikolaj Bojanczyk; Emmanuel Filiot; Anca Muscholl; Sarah Winter (Dagstuhl Reports, 2023)

Report on ICALP 2022 - 49th EATCS International Colloquium on Automata, Languages and Programming. - Anca Muscholl (Bull. EATCS, 2023)

ICALP 2024 - Call for Papers. - Anca Muscholl (Bull. EATCS, 2023)

Report on ICALP 2023. - Anca Muscholl (Bull. EATCS, 2023)

An Automata-Based Approach for Synchronizable Mailbox Communication. - Romain Delpy; Anca Muscholl; Grégoire Sutre (CONCUR, 2024)

On the Send-Synchronizability Problem for Mailbox Communication. - Romain Delpy; Anca Muscholl; Grégoire Sutre (CONCUR, 2025)

On Synthesis of Distributed Monitors (Invited Talk). - Anca Muscholl (MFCS, 2025)

Finite-valued Streaming String Transducers. - Emmanuel Filiot; Ismaël Jecker; Gabriele Puppis; Christof Löding; Anca Muscholl; Sarah Winter (TheoretiCS, 2025)