default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnca Muscholl
Person information
- affiliation: University of Bordeaux 1, LABRI, France
SPARQL queries 
🛈 Please note that only 72% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c76]Romain Delpy, Anca Muscholl, Grégoire Sutre:
An Automata-Based Approach for Synchronizable Mailbox Communication. CONCUR 2024: 22:1-22:19- [c75]Emmanuel Filiot
, Ismaël Jecker, Christof Löding, Anca Muscholl, Gabriele Puppis, Sarah Winter:
Finite-valued Streaming String Transducers. LICS 2024: 33:1-33:14 - [i29]Emmanuel Filiot, Ismaël Jecker, Gabriele Puppis, Christof Löding, Anca Muscholl, Sarah Winter:
Finite-valued Streaming String Transducers. CoRR abs/2405.08171 (2024) - [i28]Romain Delpy, Anca Muscholl, Grégoire Sutre:
An automata-based approach for synchronizable mailbox communication. CoRR abs/2407.06968 (2024) - 2023
- [j42]Anca Muscholl:
Report on ICALP 2022 - 49th EATCS International Colloquium on Automata, Languages and Programming. Bull. EATCS 139 (2023) - [j41]Anca Muscholl:
ICALP 2024 - Call for Papers. Bull. EATCS 141 (2023) - [j40]Anca Muscholl:
Report on ICALP 2023. Bull. EATCS 141 (2023) - [c74]Corto Mascle, Anca Muscholl, Igor Walukiewicz:
Model-Checking Parametric Lock-Sharing Systems Against Regular Constraints. CONCUR 2023: 24:1-24:17 - [i27]Corto Mascle, Anca Muscholl, Igor Walukiewicz:
Model-checking parametric lock-sharing systems against regular constraints. CoRR abs/2307.04925 (2023) - [i26]Rajeev Alur, Mikolaj Bojanczyk, Emmanuel Filiot, Anca Muscholl, Sarah Winter:
Regular Transformations (Dagstuhl Seminar 23202). Dagstuhl Reports 13(5): 96-113 (2023) - 2022
- [j39]Anca Muscholl:
Report on ICALP 2021. Bull. EATCS 137 (2022) - [j38]W. Alejandro Apaza-Perez, Christophe Combastel, Igor Walukiewicz, Anca Muscholl, Ali Zolghadri:
Abstraction-based control synthesis using partial information. Eur. J. Control 63: 214-222 (2022) - [c73]Hugo Gimbert, Corto Mascle, Anca Muscholl, Igor Walukiewicz:
Distributed Controller Synthesis for Deadlock Avoidance. ICALP 2022: 125:1-125:20 - [c72]Anca Muscholl, Igor Walukiewicz:
Active learning for sound negotiations✱. LICS 2022: 21:1-21:12 - [e8]Bartek Klin, Slawomir Lasota, Anca Muscholl:
33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland. LIPIcs 243, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-246-4 [contents] - [i25]Hugo Gimbert, Corto Mascle, Anca Muscholl, Igor Walukiewicz:
Distributed controller synthesis for deadlock avoidance. CoRR abs/2204.12409 (2022) - 2021
- [j37]Agnishom Chattopadhyay, Filip Mazowiecki, Anca Muscholl, Cristian Riveros:
Pumping lemmas for weighted automata. Log. Methods Comput. Sci. 17(3) (2021) - [c71]Sougata Bose, Shankara Narayanan Krishna, Anca Muscholl, Gabriele Puppis:
One-way Resynchronizability of Word Transducers. FoSSaCS 2021: 124-143 - [p2]Dietrich Kuske, Anca Muscholl:
Communicating automata. Handbook of Automata Theory (II.) 2021: 1147-1188 - [i24]Sougata Bose, Shankara Narayanan Krishna, Anca Muscholl, Gabriele Puppis:
One-way resynchronizability of word transducers. CoRR abs/2101.08011 (2021) - [i23]Anca Muscholl, Igor Walukiewicz:
Active Learning for Sound Negotiations. CoRR abs/2110.02783 (2021) - 2020
- [j36]Anca Muscholl:
The Presburger Award 2020 - Laudatio for Dmitriy Zhuk. Bull. EATCS 131 (2020) - [j35]Artur Czumaj, Anca Muscholl:
Report on ICALP 2020. Bull. EATCS 132 (2020) - [j34]Olivier Gauwin, Anca Muscholl, Michael Raskin:
Minimization of visibly pushdown automata is NP-complete. Log. Methods Comput. Sci. 16(1) (2020) - [e7]Maribel Fernández, Anca Muscholl:
28th EACSL Annual Conference on Computer Science Logic, CSL 2020, January 13-16, 2020, Barcelona, Spain. LIPIcs 152, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-132-0 [contents] - [i22]Agnishom Chattopadhyay, Filip Mazowiecki, Anca Muscholl, Cristian Riveros:
Pumping lemmas for weighted automata. CoRR abs/2001.06272 (2020)
2010 – 2019
- 2019
- [j33]Thore Husfeldt, Meena Mahajan, Anca Muscholl:
The Presburger Award for Young Scientists 2020 - Call for Nominations. Bull. EATCS 129 (2019) - [c70]Anca Muscholl, Gabriele Puppis:
Equivalence of Finite-Valued Streaming String Transducers Is Decidable. ICALP 2019: 122:1-122:15 - [c69]Sougata Bose, Shankara Narayanan Krishna, Anca Muscholl, Vincent Penelle, Gabriele Puppis:
On Synthesis of Resynchronizers for Transducers. MFCS 2019: 69:1-69:14 - [c68]Anca Muscholl, Gabriele Puppis:
The Many Facets of String Transducers (Invited Talk). STACS 2019: 2:1-2:21 - [i21]Anca Muscholl, Gabriele Puppis:
Equivalence of finite-valued streaming string transducers is decidable. CoRR abs/1902.06973 (2019) - [i20]Sougata Bose, Shankara Narayanan Krishna, Anca Muscholl, Vincent Penelle, Gabriele Puppis:
On Synthesis of Resynchronizers for Transducers. CoRR abs/1906.08688 (2019) - [i19]Olivier Gauwin, Anca Muscholl, Michael A. Raskin:
Minimization of visibly pushdown automata is NP-complete. CoRR abs/1907.09563 (2019) - 2018
- [j32]Javier Esparza, Denis Kuperberg, Anca Muscholl, Igor Walukiewicz:
Soundness in negotiations. Log. Methods Comput. Sci. 14(1) (2018) - [j31]Félix Baschenis, Olivier Gauwin, Anca Muscholl, Gabriele Puppis:
One-way definability of two-way word transducers. Log. Methods Comput. Sci. 14(4) (2018) - [c67]Sougata Bose, Anca Muscholl, Vincent Penelle, Gabriele Puppis:
Origin-Equivalence of Two-Way Word Transducers Is in PSPACE. FSTTCS 2018: 22:1-22:18 - [c66]Emmanuel Filiot, Olivier Gauwin, Nathan Lhote, Anca Muscholl:
On Canonical Models for Rational Functions over Infinite Words. FSTTCS 2018: 30:1-30:17 - [i18]Sougata Bose, Anca Muscholl, Vincent Penelle, Gabriele Puppis:
Origin-equivalence of two-way word transducers is in PSPACE. CoRR abs/1807.08053 (2018) - [i17]Javier Esparza, Pierre Fraigniaud, Anca Muscholl, Sergio Rajsbaum:
Formal Methods and Fault-Tolerant Distributed Comp.: Forging an Alliance (Dagstuhl Seminar 18211). Dagstuhl Reports 8(5): 60-79 (2018) - 2017
- [c65]Marie Fortin, Anca Muscholl, Igor Walukiewicz:
Model-Checking Linear-Time Properties of Parametrized Asynchronous Shared-Memory Pushdown Systems. CAV (2) 2017: 155-175 - [c64]Anca Muscholl:
A Tour of Recent Results on Word Transducers. FCT 2017: 29-33 - [c63]Anca Muscholl:
Automated Synthesis: a Distributed Viewpoint. FSTTCS 2017: 3:1-3:5 - [c62]Félix Baschenis, Olivier Gauwin, Anca Muscholl, Gabriele Puppis:
Untwisting two-way transducers in elementary time. LICS 2017: 1-12 - [c61]Javier Esparza, Anca Muscholl, Igor Walukiewicz:
Static analysis of deterministic negotiations. LICS 2017: 1-12 - [c60]Paul Gallot, Anca Muscholl, Gabriele Puppis, Sylvain Salvati:
On the Decomposition of Finite-Valued Streaming String Transducers. STACS 2017: 34:1-34:14 - [c59]Anca Muscholl, Helmut Seidl, Igor Walukiewicz:
Reachability for Dynamic Parametric Processes. VMCAI 2017: 424-441 - [e6]Ioannis Chatzigiannakis, Piotr Indyk, Fabian Kuhn, Anca Muscholl:
44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland. LIPIcs 80, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-041-5 [contents] - [i16]Félix Baschenis, Olivier Gauwin, Anca Muscholl, Gabriele Puppis:
Untwisting two-way transducers in elementary time. CoRR abs/1701.02502 (2017) - [i15]Javier Esparza, Denis Kuperberg, Anca Muscholl, Igor Walukiewicz:
Soundness in negotiations. CoRR abs/1703.05137 (2017) - [i14]Javier Esparza, Anca Muscholl, Igor Walukiewicz:
Static Analysis of Deterministic Negotiations. CoRR abs/1704.04190 (2017) - [i13]Félix Baschenis, Olivier Gauwin, Anca Muscholl, Gabriele Puppis:
One-way definability of two-way word transducers. CoRR abs/1706.01668 (2017) - 2016
- [j30]Piotr Indyk, Anca Muscholl, Fabian Kuhn:
ICALP 2017 - Call for Papers. Bull. EATCS 120 (2016) - [j29]Anca Muscholl, Martin Dietzfelbinger:
Preface of STACS 2013 Special Issue. Theory Comput. Syst. 58(4): 503-505 (2016) - [j28]Amaldev Manuel, Anca Muscholl, Gabriele Puppis:
Walking on Data Words. Theory Comput. Syst. 59(2): 180-208 (2016) - [j27]Anca Muscholl, Sven Schewe:
Controlling loosely cooperating processes. Theor. Comput. Sci. 611: 136-141 (2016) - [c58]Javier Esparza, Denis Kuperberg, Anca Muscholl, Igor Walukiewicz:
Soundness in Negotiations. CONCUR 2016: 12:1-12:13 - [c57]Anca Muscholl:
Automated Synthesis: Going Distributed. CSL 2016: 3:1-3:2 - [c56]Félix Baschenis, Olivier Gauwin, Anca Muscholl, Gabriele Puppis:
Minimizing Resources of Sweeping and Streaming String Transducers. ICALP 2016: 114:1-114:14 - [e5]Piotr Faliszewski, Anca Muscholl, Rolf Niedermeier:
41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Kraków, Poland. LIPIcs 58, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2016, ISBN 978-3-95977-016-3 [contents] - [i12]Marie Fortin, Anca Muscholl, Igor Walukiewicz:
On parametrized verification of asynchronous, shared-memory pushdown systems. CoRR abs/1606.08707 (2016) - [i11]Anca Muscholl, Helmut Seidl, Igor Walukiewicz:
Reachability for dynamic parametric processes. CoRR abs/1609.05385 (2016) - 2015
- [c55]Anca Muscholl:
On Distributed Monitoring and Synthesis. CiE 2015: 54-62 - [c54]Salvatore La Torre, Anca Muscholl, Igor Walukiewicz:
Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable. CONCUR 2015: 72-84 - [c53]Félix Baschenis, Olivier Gauwin, Anca Muscholl, Gabriele Puppis:
One-way Definability of Sweeping Transducer. FSTTCS 2015: 178-191 - [c52]Anca Muscholl:
Automated Synthesis of Distributed Controllers. ICALP (2) 2015: 11-27 - [c51]Volker Diekert, Anca Muscholl, Igor Walukiewicz:
A Note on Monitors and Büchi Automata. ICTAC 2015: 39-57 - [i10]Anca Muscholl:
Automated Synthesis of Distributed Controllers. CoRR abs/1506.02369 (2015) - [i9]Volker Diekert, Anca Muscholl, Igor Walukiewicz:
A Note on Monitors and Büchi automata. CoRR abs/1507.01020 (2015) - 2014
- [c50]Anca Muscholl, Igor Walukiewicz:
Distributed Synthesis for Acyclic Architectures. FSTTCS 2014: 639-651 - [e4]Anca Muscholl:
Foundations of Software Science and Computation Structures - 17th International Conference, FOSSACS 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014, Proceedings. Lecture Notes in Computer Science 8412, Springer 2014, ISBN 978-3-642-54829-1 [contents] - [i8]Anca Muscholl, Igor Walukiewicz:
Distributed synthesis for acyclic architectures. CoRR abs/1402.3314 (2014) - 2013
- [j26]Anca Muscholl:
Call for Nominations For EATCS - Fellows 2014. Bull. EATCS 111 (2013) - [j25]Siddharth Krishna, Anca Muscholl:
A quadratic construction for Zielonka automata with acyclic communication structure. Theor. Comput. Sci. 503: 109-114 (2013) - [c49]Amaldev Manuel, Anca Muscholl, Gabriele Puppis:
Walking on Data Words. CSR 2013: 64-75 - [c48]Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz:
Asynchronous Games over Tree Architectures. ICALP (2) 2013: 275-286 - [c47]Serge Abiteboul, Pierre Bourhis, Anca Muscholl, Zhilin Wu:
Recursive queries on trees and data trees. ICDT 2013: 93-104 - [c46]Anca Muscholl, Sven Schewe:
Unlimited Decidability of Distributed Synthesis with Limited Missing Knowledge. MFCS 2013: 691-703 - 2012
- [j24]Alexander Heußner, Jérôme Leroux, Anca Muscholl, Grégoire Sutre:
Reachability Analysis of Communicating Pushdown Systems. Log. Methods Comput. Sci. 8(3) (2012) - [c45]Volker Diekert, Anca Muscholl:
On Distributed Monitoring of Asynchronous Systems. WoLLIC 2012: 70-84 - [i7]Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz:
Asynchronous Games over Tree Architectures. CoRR abs/1204.0077 (2012) - [i6]Jakub Michaliszyn, Anca Muscholl, Slawek Staworko, Piotr Wieczorek, Zhilin Wu:
On Injective Embeddings of Tree Patterns. CoRR abs/1204.4948 (2012) - [i5]Volker Diekert, Anca Muscholl:
On distributed monitoring of asynchronous systems. CoRR abs/1208.2125 (2012) - 2011
- [j23]Mikolaj Bojanczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin:
Two-variable logic on data words. ACM Trans. Comput. Log. 12(4): 27:1-27:26 (2011) - [r1]Volker Diekert, Anca Muscholl:
Trace Theory. Encyclopedia of Parallel Computing 2011: 2071-2079 - 2010
- [c44]Anca Muscholl:
Taming Distributed Asynchronous Systems. CONCUR 2010: 40-47 - [c43]Alexander Heußner, Jérôme Leroux, Anca Muscholl, Grégoire Sutre:
Reachability Analysis of Communicating Pushdown Systems. FoSSaCS 2010: 267-281 - [c42]Blaise Genest, Anca Muscholl, Zhilin Wu:
Verifying Recursive Active Documents with Positive Data Tree Rewriting. FSTTCS 2010: 469-480 - [c41]Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz:
Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata. ICALP (2) 2010: 52-63 - [c40]Anca Muscholl:
Analysis of Communicating Automata. LATA 2010: 50-57 - [e3]Jan van Leeuwen, Anca Muscholl, David Peleg, Jaroslav Pokorný, Bernhard Rumpe:
SOFSEM 2010: Theory and Practice of Computer Science, 36th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 23-29, 2010. Proceedings. Lecture Notes in Computer Science 5901, Springer 2010, ISBN 978-3-642-11265-2 [contents] - [i4]Blaise Genest, Anca Muscholl, Zhilin Wu:
Verifying Recursive Active Documents with Positive Data Tree Rewriting. CoRR abs/1003.1010 (2010)
2000 – 2009
- 2009
- [j22]Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin:
Two-variable logic on data trees and XML reasoning. J. ACM 56(3): 13:1-13:48 (2009) - 2008
- [j21]Anca Muscholl, Igor Walukiewicz:
A Lower Bound on Web Services Composition. Log. Methods Comput. Sci. 4(2) (2008) - [j20]Blaise Genest, Anca Muscholl:
Pattern Matching and Membership for Hierarchical Message Sequence Charts. Theory Comput. Syst. 42(4): 536-567 (2008) - [c39]Blaise Genest, Anca Muscholl, Olivier Serre, Marc Zeitoun:
Tree Pattern Rewriting Systems. ATVA 2008: 332-346 - [c38]Helmut Seidl, Thomas Schwentick, Anca Muscholl:
Counting in trees. Logic and Automata 2008: 575-612 - [e2]Anca Muscholl, Ramaswamy Ramanujam, Michaël Rusinowitch, Thomas Schwentick, Victor Vianu:
Beyond the Finite: New Challenges in Verification and Semistructured Data, 20.04. - 25.04.2008. Dagstuhl Seminar Proceedings 08171, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2008 [contents] - [i3]Anca Muscholl, Ramaswamy Ramanujam, Michaël Rusinowitch, Thomas Schwentick, Victor Vianu:
08171 Abstracts Collection - Beyond the Finite: New Challenges in Verification and Semistructured Data. Beyond the Finite: New Challenges in Verification and Semistructured Data 2008 - [i2]Anca Muscholl, Ramaswamy Ramanujam, Michaël Rusinowitch, Thomas Schwentick, Victor Vianu:
08171 Summary - Beyond the Finite: New Challenges in Verification and Semistructured Data. Beyond the Finite: New Challenges in Verification and Semistructured Data 2008 - [i1]Anca Muscholl, Igor Walukiewicz:
A lower bound on web services composition. CoRR abs/0804.3105 (2008) - 2007
- [j19]Blaise Genest, Dietrich Kuske, Anca Muscholl:
On Communicating Automata with Bounded Channels. Fundam. Informaticae 80(1-3): 147-167 (2007) - [j18]Ahmed Bouajjani, Anca Muscholl, Tayssir Touili:
Permutation rewriting and algorithmic verification. Inf. Comput. 205(2): 199-224 (2007) - [c37]Anca Muscholl, Igor Walukiewicz:
A Lower Bound on Web Services Composition. FoSSaCS 2007: 274-286 - 2006
- [j17]Blaise Genest, Dietrich Kuske, Anca Muscholl:
A Kleene theorem and model checking algorithms for existentially bounded communicating automata. Inf. Comput. 204(6): 920-956 (2006) - [j16]Volker Diekert, Anca Muscholl:
Solvability of Equations in Graph Groups Is Decidable. Int. J. Algebra Comput. 16(6): 1047-1070 (2006) - [j15]Anca Muscholl, Mathias Samuelides, Luc Segoufin:
Complementing deterministic tree-walking automata. Inf. Process. Lett. 99(1): 33-39 (2006) - [j14]Blaise Genest, Anca Muscholl, Helmut Seidl, Marc Zeitoun:
Infinite-state high-level MSCs: Model-checking and realizability. J. Comput. Syst. Sci. 72(4): 617-647 (2006) - [j13]Anca Muscholl, Thomas Schwentick, Luc Segoufin:
Active Context-Free Games. Theory Comput. Syst. 39(1): 237-276 (2006) - [c36]Blaise Genest, Anca Muscholl:
Constructing Exponential-Size Deterministic Zielonka Automata. ICALP (2) 2006: 565-576 - [c35]Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin, Claire David:
Two-Variable Logic on Words with Data. LICS 2006: 7-16 - [c34]Mikolaj Bojanczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin:
Two-variable logic on data trees and XML reasoning. PODS 2006: 10-19 - 2005
- [j12]Anca Muscholl, Igor Walukiewicz:
An NP-complete fragment of LTL. Int. J. Found. Comput. Sci. 16(4): 743-753 (2005) - [c33]Blaise Genest, Anca Muscholl:
Message Sequence Charts: A Survey. ACSD 2005: 2-4 - [c32]Blaise Genest, Dietrich Kuske, Anca Muscholl, Doron A. Peled:
Snapshot Verification. TACAS 2005: 510-525 - 2004
- [j11]Markus Lohrey, Anca Muscholl:
Bounded MSC communication. Inf. Comput. 189(2): 160-181 (2004) - [j10]Emmanuel Godard, Yves Métivier, Anca Muscholl:
Characterizations of Classes of Graphs Recognizable by Local Computations. Theory Comput. Syst. 37(2): 249-293 (2004) - [c31]Blaise Genest, Anca Muscholl, Dietrich Kuske:
A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms. Developments in Language Theory 2004: 30-48 - [c30]Anca Muscholl, Igor Walukiewicz:
An NP-Complete Fragment of LTL. Developments in Language Theory 2004: 334-344 - [c29]Blaise Genest, Marius Minea, Anca Muscholl, Doron A. Peled:
Specifying and Verifying Partial Order Properties Using Template MSCs. FoSSaCS 2004: 195-210 - [c28]Helmut Seidl, Thomas Schwentick, Anca Muscholl, Peter Habermehl:
Counting in Trees for Free. ICALP 2004: 1136-1149 - [c27]Anca Muscholl, Thomas Schwentick, Luc Segoufin:
Active Context-Free Games. STACS 2004: 452-464 - 2003
- [j9]Elsa L. Gunter, Anca Muscholl, Doron A. Peled:
Compositional message sequence charts. Int. J. Softw. Tools Technol. Transf. 5(1): 78-89 (2003) - [c26]Blaise Genest, Anca Muscholl, Doron A. Peled:
Message Sequence Charts. Lectures on Concurrency and Petri Nets 2003: 537-558 - [c25]Alin Stefanescu, Javier Esparza, Anca Muscholl:
Synthesis of Distributed Algorithms Using Asynchronous Automata. CONCUR 2003: 27-41 - [c24]Blaise Genest, Loïc Hélouët, Anca Muscholl:
High-Level Message Sequence Charts and Projections. CONCUR 2003: 308-322 - [c23]Anca Muscholl, Doron A. Peled:
Deciding Properties of Message Sequence Charts. Scenarios: Models, Transformations and Tools 2003: 43-65 - [c22]Helmut Seidl, Thomas Schwentick, Anca Muscholl:
Numerical document queries. PODS 2003: 155-166 - 2002
- [c21]Markus Lohrey, Anca Muscholl:
Bounded MSC Communication. FoSSaCS 2002: 295-309 - [c20]Blaise Genest, Anca Muscholl, Helmut Seidl, Marc Zeitoun:
Infinite-State High-Level MSCs: Model-Checking and Realizability. ICALP 2002: 657-668 - [c19]Blaise Genest, Anca Muscholl:
Pattern Matching and Membership for Hierarchical Message Sequence Charts. LATIN 2002: 326-340 - [c18]Benoît Caillaud, Anca Muscholl:
Preface. VISS@ETAPS 2002: 100 - [e1]Benoît Caillaud, Anca Muscholl:
Validation and Implementation of Scenario-based Specifications, VISS 2002, Satellite Event of ETAPS 2002, Grenoble, France, April 6-14, 2002. Electronic Notes in Theoretical Computer Science 65(7), Elsevier 2002 [contents] - 2001
- [c17]Volker Diekert, Anca Muscholl:
Solvability of Equations in Free Partially Commutative Groups Is Decidable. ICALP 2001: 543-554 - [c16]Anca Muscholl, Doron A. Peled:
From Finite State Communication Protocols to High-Level Message Sequence Charts. ICALP 2001: 720-731 - [c15]Ahmed Bouajjani, Anca Muscholl, Tayssir Touili:
Permutation Rewriting and Algorithmic Verification. LICS 2001: 399-408 - [c14]Elsa L. Gunter, Anca Muscholl, Doron A. Peled:
Compositional Message Sequence Charts. TACAS 2001: 496-511 - 2000
- [j8]Christian Hagenah, Anca Muscholl:
Computing epsilon-free NFA from regular expressions in O(n log2(n)) time. RAIRO Theor. Informatics Appl. 34(4): 257-278 (2000) - [c13]Anca Muscholl, Doron A. Peled:
Analyzing Message Sequence Charts. SAM 2000: 3-17
1990 – 1999
- 1999
- [b2]Anca Muscholl:
Decision and complexity issues on concurrent systems. Universität Stuttgart 1999, pp. I-VIII, 1-136 - [j7]Volker Diekert, Yuri V. Matiyasevich, Anca Muscholl:
Solving Word Equations modulo Partial Commutations. Theor. Comput. Sci. 224(1-2): 215-235 (1999) - [c12]Anca Muscholl:
Matching Specifications for Message Sequence Charts. FoSSaCS 1999: 273-287 - [c11]Anca Muscholl, Doron A. Peled:
Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces. MFCS 1999: 81-91 - 1998
- [c10]Anca Muscholl, Doron A. Peled, Zhendong Su:
Deciding Properties for Message Sequence Charts. FoSSaCS 1998: 226-242 - [c9]Christian Hagenah, Anca Muscholl:
Computing epsilon-Free NFA from Regular Expressions in O(n log²(n)) Time. MFCS 1998: 277-285 - [c8]Emmanuel Godard, Yves Métivier, Anca Muscholl:
The Power of Local Computations in Graphs with Initial Knowledge. TAGT 1998: 71-84 - 1997
- [j6]Hendrik Jan Hoogeboom, Anca Muscholl:
The Code Problem for Traces - Improving the Boundaries. Theor. Comput. Sci. 172(1-2): 309-321 (1997) - [c7]Volker Diekert, Yuri V. Matiyasevich, Anca Muscholl:
Solving Trace Equations Using Lexicographical Normal Forms. ICALP 1997: 336-346 - [c6]Yves Métivier, Anca Muscholl, Pierre-André Wacrenier:
About the local detection of termination of local computations in graphs. SIROCCO 1997: 188-200 - 1996
- [j5]Volker Diekert, Anca Muscholl:
A Note on Métivier's Construction of Asynchronous Automata for Triangulated Graphs. Fundam. Informaticae 25(3): 241-246 (1996) - [j4]Anca Muscholl, Holger Petersen:
A Note on the Commutative Closure of Star-Free Languages. Inf. Process. Lett. 57(2): 71-74 (1996) - [j3]Werner Ebinger, Anca Muscholl:
Logical Definability on Infinite Traces. Theor. Comput. Sci. 154(1): 67-84 (1996) - [j2]Anca Muscholl:
On the Complementation of Asynchronous Cellular Büchi Automata. Theor. Comput. Sci. 169(2): 123-145 (1996) - [c5]Volker Diekert, Anca Muscholl:
Code Problems on Traces. MFCS 1996: 2-17 - 1995
- [c4]Volker Diekert, Anca Muscholl, Klaus Reinhardt:
On Codings of Traces. STACS 1995: 385-396 - [p1]Volker Diekert, Anca Muscholl:
Construction of Asynchronous Automata. The Book of Traces 1995: 249-267 - 1994
- [b1]Anca Muscholl:
Über die Erkennbarkeit unendlicher Spuren. University of Stuttgart, Germany, 1994, pp. 1-79 - [j1]Volker Diekert, Anca Muscholl:
Deterministic Asynchronous Automata for Infinite Traces. Acta Informatica 31(4): 379-397 (1994) - [c3]Anca Muscholl:
On the Complementation of Büchi Asynchronous Cellular Automata. ICALP 1994: 142-153 - 1993
- [c2]Werner Ebinger, Anca Muscholl:
Logical Definability on Infinite Traces. ICALP 1993: 335-346 - [c1]Volker Diekert, Anca Muscholl:
Deterministic Asynchronous Automata for Infinite Traces. STACS 1993: 617-628
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
