Publications

Anca Muscholl

Last update: 09/2015


Conference papers

F. Baschenis, O. Gauwin, A. Muscholl, G. Puppis. One-way definability of sweeping transducers
Proc. of FSTTCS'15, LIPIcs, 2015.

S. La Torre, A. Muscholl, I. Walukiewicz. Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable
Proc. of CONCUR'15, LIPIcs, pp. 72-84, 2015.

A. Muscholl. Automated Synthesis of Distributed Controllers
Proc. of ICALP-LICS'15, LNCS, pp. 11-27, 2015.

V. Diekert, A. Muscholl, I. Walukiewicz. A Note on Monitors and Buechi Automata
Proc. of ICTAC'15, LNCS, pp. 39-57, 2015.

A. Muscholl, I. Walukiewicz. Distributed Synthesis for Acyclic Architectures
Proc. of FSTTCS'14, LIPIcs, pp. 639-651, 2014.

B. Genest, H. Gimbert, A. Muscholl, I. Walukiewicz. Asynchronous Games over Tree Architectures
Proc. of ICALP'13, LNCS, pp. 275-286, 2013.

A. Manuel, A. Muscholl and G. Puppis. Walking on Data Words
Proc. of CSR'13, LNCS, pp. 64-75, 2013.

A. Muscholl and S. Schewe. Unlimited Decidability of Distributed Synthesis with Limited Missing Knowledge
Proc. of MFCS'13, LNCS, pp. 691-703, 2013.

S. Abiteboul, P. Bourhis, A. Muscholl and Z. Wu. Recursive queries on trees and data trees
Proc. of ICDT'13, ACM, pp. 93-104, 2013.

V. Diekert and A. Muscholl. On Distributed Monitoring of Asynchronous Systems
Proc. of WoLLIC'12, Lecture Notes in Computer Science 7456, pp. 70-84, 2012.

A. Heussner, J. Leroux, A. Muscholl and G. Sutre. Reachability Analysis of Communicating Pushdown Systems
Proc. of FoSSacS'10, Lecture Notes in Computer Science 6014, pp. 267-281, 2010. Journal version.

B. Genest, H. Gimbert, A. Muscholl and I. Walukiewicz. Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata
Proc. of ICALP'10, Lecture Notes in Computer Science 6199, pp. 52-63, 2010.

A. Muscholl. Taming Distributed Asynchronous Systems (invited talk)
Proc. of CONCUR'10, Lecture Notes in Computer Science 6269, pp. 40-47, 2010.

B. Genest, A. Muscholl and Z. Wu. Verifying Recursive Active Documents with Positive Data Tree Rewriting
Proc. of FSTTCS'10, LIPIcs 8, 2010.

A. Muscholl. Analysis of Communicating Automata (invited talk)
Proc. of LATA'10, Lecture Notes in Computer Science 6031, pp. 50-57, 2010.

B. Genest, A. Muscholl, O. Serre, M. Zeitoun. Tree Pattern Rewriting Systems
Proc. of ATVA'08, Lecture Notes in Computer Science 5311, pp. 332-346, 2008.

A. Muscholl, I. Walukiewicz. A lower bound on Web services composition ,
Proc. of FoSSaCS'07, Lecture Notes in Computer Science 4423, pp. 274-286, 2007. Journal version.

B. Genest, A. Muscholl. Constructing Exponential-size Deterministic Zielonka Automata ,
Proc. of ICALP'06, Lecture Notes in Computer Science 4052, pp. 565-576, 2006.

M. Bojanczyk, A. Muscholl, Th. Schwentick, L. Segoufin and C. David. Two-Variable Logic on Words with Data ,
Proc. of LICS'06, pp. 7-16.Journal version.

M. Bojanczyk, C. David, A. Muscholl, Th. Schwentick, and L. Segoufin. Two-Variable Logic on Data Trees and XML Reasoning ,
Proc. of PODS'06, pp. 10-19. Journal version.

B. Genest, D. Kuske and A. Muscholl. A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms ,
Proc. of DLT'04, Lecture Notes in Computer Science 3340, pp. 30-48, 2004. Journal version.

A. Muscholl and I. Walukiewicz. An NP-Complete Fragment of LTL ,
Proc. of DLT'04, Lecture Notes in Computer Science 3340, pp. 334-344, 2004.
Appeared in International Journal of Foundations of Computer Science, 16(4):743-754, 2005.

H. Seidl, Th. Schwentick, A. Muscholl and P. Habermehl. Counting in Trees for Free ,
Proc. of ICALP'04, Lecture Notes in Computer Science 3142, pp. 1136-1149, 2004. Journal version.

A. Muscholl, Th. Schwentick and L. Segoufin. Active Context-Free Games ,
Proc. of STACS'04, Lecture Notes in Computer Science 2996, pp. 452-464, 2004. Journal version.

B. Genest, M. Minea, A. Muscholl and D. Peled. Specifying and Verifying Partial Order Properties Using Template MSCs ,
Proc. of FoSSaCS'04, Lecture Notes in Computer Science 2987, pp. 195-210, 2004.

A. Stefanescu, J. Esparza, A. Muscholl. Synthesis of Distributed Algorithms Using Asynchronous Automata ,
Proc. of CONCUR'03, Lecture Notes in Computer Science 2761, pp. 27-41, 2003.

B. Genest, L. Helouet, A. Muscholl. High-Level Message Sequence Charts and Projections ,
Proc. of CONCUR'03, Lecture Notes in Computer Science 2761, pp. 308-322, 2003.

H. Seidl, Th. Schwentick, A. Muscholl. Numerical document queries ,
Proc. of PODS'03,, pp. 155-166, ACM 2003. Journal version.

B. Genest, A. Muscholl, H. Seidl, M. Zeitoun. Infinite-State High-Level MSCs: Model-Checking and Realizability ,
Proc. of ICALP'02, Lecture Notes in Computer Science 2380, pp. 657-668, 2002. Long version.

M. Lohrey, A. Muscholl. Bounded MSC Communication ,
Proc. of FoSSaCS'02, Lecture Notes in Computer Science 2303, pp. 295-309, 2002. Journal version.

B. Genest, A. Muscholl. Pattern Matching and Membership for Hierarchical Message Sequence Charts ,
Proc. of LATIN'02, Lecture Notes in Computer Science 2286, pp. 326-340, 2002. Journal version.

V. Diekert, A. Muscholl. Decidability of Equations in Free Partially Commutative Groups ,
Proc. of ICALP'01, Lecture Notes in Computer Science 2076, pp. 543-554, 2001. Journal version.

A. Muscholl, D. Peled. From Finite State Communication Protocols to High-Level Message Sequence Charts,
Proc. of ICALP'01, Lecture Notes in Computer Science 2076, pp. 720-731, 2001.

A. Bouajjani, A. Muscholl, T. Touili. Permutation Rewriting and Algorithmic Verification ,
Proc. of LICS'01, IEEE Computer Society, pp. 399-408, 2001. Journal version.

E. Gunter, A. Muscholl, D. Peled. Compositional Message Sequence Charts,
Proc. of TACAS'01, Lecture Notes in Computer Science 2031, pp. 496-511, 2001. Journal version.

A. Muscholl, D. Peled. Analyzing Message Sequence Charts,
Proc. of SAM'00, Grenoble, june 26-28, 2000.

A. Muscholl, D. Peled. Message sequence graphs and decision problems on Mazurkiewicz traces,
Proc. of MFCS'99, Lecture Notes in Computer Science 1672, pp. 81-91, 1999.

A. Muscholl. Matching specifications for message sequence charts,
Proc. of FoSSaCS'99, Lecture Notes in Computer Science 1578, 1999.

A. Muscholl, D. Peled, Z. Su. Deciding properties of message sequence charts,
Proc. of FoSSaCS'98, Lecture Notes in Computer Science 1378, pp. 226-242, 1998.

V. Diekert, Yu. Matiyasevich, and A. Muscholl. Solving Trace Equations Using Lexicographical Normal Forms (journal version) ,
Proc. of ICALP'97, Lecture Notes in Computer Science 1256, pp. 336-346, 1997.

Y. Métivier, A. Muscholl, P.-A. Wacrenier. About the local detection of termination of local computations in graphs,
Proc. of SIROCCO'97, Carleton Scientific, pp. 188-200, 1997.

V. Diekert, A. Muscholl. Code problems on traces,
Proc. of MFCS'96, Lecture Notes in Computer Science 1113, pp. 2-17, 1996.

V. Diekert, A. Muscholl, K. Reinhardt. On codings of traces,
Proc. of STACS'95, Lecture Notes in Computer Science 900, pp. 385-396, 1995.

A. Muscholl. On the complementation of Buechi asynchronous cellular automata,
Proc. of ICALP'94, Lecture Notes in Computer Science 820, pp. 142-153, 1994. Journal version.

W. Ebinger, A. Muscholl. On logical definability of omega-trace languages,
Proc. of ICALP'93, Lecture Notes in Computer Science 700, pp. 335-346, 1993. Journal version.

V. Diekert, A. Muscholl. Deterministic asynchronous automata for infinite traces,
Proc. of STACS'93, Lecture Notes in Computer Science 665, pp. 617-628, 1993. Journal version.


Journal papers

A. Manuel, A. Muscholl and G. Puppis. Walking on Data Words
Theory of Computing Systems, 2014.

S. Krishna, A. Muscholl. A quadratic construction for Zielonka automata with acyclic communication structure.
Theor. Comp. Science, 503: 109-114, 2013.

A. Heussner, J. Leroux, A. Muscholl and G. Sutre. Reachability Analysis of Communicating Pushdown Systems
Logical Methods in Computer Science, 8(3), 2012.

M. Bojanczyk, C. David, A. Muscholl, Th. Schwentick, and L. Segoufin. Two-variable logic on data words.
ACM Trans. Comput. Log. 12(4): 27, 2011.

M. Bojanczyk, A. Muscholl, Th. Schwentick, and L. Segoufin. Two-variable logic on data trees and XML reasoning
J. of the ACM 56(3), 2009.

B. Genest, A. Muscholl. Pattern Matching and Membership for Hierarchical Message Sequence Charts
Theory of Comput. Syst. 42(4):536--567, 2008.

A. Muscholl, I. Walukiewicz. A lower bound on Web services composition
Logical Methods in Computer Science 4(2:5):1--14, 2008.

H. Seidl, Th. Schwentick, and A. Muscholl. Counting in trees
Texts in Logic and Games (2):575-612, Amsterdam University Press, 2007.

B. Genest, D. Kuske and A. Muscholl. On communicating automata with bounded channels
Fundamenta Informatica 80(2):147-167, 2007.

A. Bouajjani, A. Muscholl and T. Touili. Permutation Rewriting and Algorithmic Verification
Information and Computation 205(2):199-224, 2007.

B. Genest, D. Kuske and A. Muscholl. A Kleene theorem and model checking algorithms for existentially bounded communicating automata
Information and Computation 204(6):920-956, 2006.

B. Genest, A. Muscholl, H. Seidl and M. Zeitoun. Infinite-state high-level MSCs: Model-checking and realizability
J. of Computer and System Sciences, 72(4):617-647, 2006.

A. Muscholl, M. Samuelides and L. Segoufin. Complementing deterministic tree-walking automata
Inf. Proc. Lett., 99(1):33-39, 2006.

A. Muscholl, Th. Schwentick and L. Segoufin. Active Context-Free Games
Theory of Computing Systems 39(1):237-276, 2006. Special issue of STACS'04.

V. Diekert, A. Muscholl. Solvability of equations in graph groups is decidable.
Intern. Journal of Algebra and Computation, 16(6):1047-1070, 2006. Preliminary version in ICALP'01.

M. Lohrey, A. Muscholl. Bounded MSC Communication,
Information and Computation 189(2):160-181, 2004. Preliminary version in FoSSaCS'02.

E. Godard, Y. Métivier and A. Muscholl. Characterizations of Classes of Graphs Recognizable by Local Computations,
Theory Comput. Syst. 37(2): 249-293, 2004.

E. Gunter, A. Muscholl, D. Peled. Compositional Message Sequence Charts,
STTT - Int. Journal on Software Tools for Technology Transfer 5(1):78-89, Springer 2003. Preliminary version in TACAS'01.

Ch. Hagenah, A. Muscholl. Computing $\epsilon$-Free NFA from Regular Expressions in $O(n \log^2(n))$ Time,
R.A.I.R.O. Theoretical Informatics and Applications 34:257-277, 2000. Preliminary version in MFCS'98.

V. Diekert, Yu. Matiyasevich, A. Muscholl. Word equations modulo partial commutations,
Theoretical Computer Science 224:215-235, 1999. Preliminary version in ICALP'97.

H.-J. Hoogeboom, A. Muscholl. The code problem for traces - improving the boundaries,
Theoretical Computer Science. 172:309-321, 1997.

A. Muscholl. On the complementation of Buechi asynchronous cellular automata,
Theoretical Computer Science 169:123-145, 1996. Special issue of ICALP'94.

W. Ebinger, A. Muscholl. On logical definability of omega-trace languages,
Theoretical Computer Science 154:67-84, 1996. Special issue of ICALP'93.

V. Diekert, A. Muscholl. A note on Métivier's construction of asynchronous automata for triangulated graphs,
Fundamenta Informatica 25:241-246, 1996.

A. Muscholl, H. Petersen. A note on the commutative closure of star-free languages.,
Information Processing Letters 57:71-74, 1996.

V. Diekert, A. Muscholl. Deterministic asynchronous automata for infinite traces,
Theoretical Computer Science 31:379-397, 1994. Preliminary version in STACS'93.


Collected contributions

A. Muscholl, I. Walukiewicz, M. Zeitoun. A look at the control of asynchronous automata ,
Perspectives in Concurrency Theory, Universities Press, 2009.

B. Genest, A. Muscholl and D. Peled. Message Sequence Charts ,
Lectures on Concurrency and Petri Nets: Advances in Petri nets (Tutorial volume from the 4th Advanced Course on Petri Nets, ACPN 2003), pp. 537-558, 2003.

V. Diekert, A. Muscholl. Construction of asynchronous automata.
Chapter 8 in The Book of traces, eds. V. Diekert and G. Rozenberg, World Scientific, pp. 249-167, 1995.

Books

A. Muscholl. Über die Erkennbarkeit unendlicher Spuren,Teubner-Texte zur Informatik, Band 17, Teubner, 1996.


Other publications

Über die Erkennbarkeit unendlicher Spuren. PhDThesis, Institut für Informatik, Universität Stuttgart (1994).

Decidability and complexity issues on concurrent systems. Habilitation thesis, Institut für Informatik, Universität Stuttgart (1999).