Two-variable logic on data trees and XML reasoning M Bojańczyk, A Muscholl, T Schwentick, L Segoufin
Journal of the ACM (JACM) 56 (3), 1-48, 2009
244 2009 Two-variable logic on words with data M Bojanczyk, A Muscholl, T Schwentick, L Segoufin, C David
21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), 7-16, 2006
228 2006 Two-variable logic on data words M Bojańczyk, C David, A Muscholl, T Schwentick, L Segoufin
ACM Transactions on Computational Logic (TOCL) 12 (4), 1-26, 2011
175 2011 Deciding properties for message sequence charts A Muscholl, D Peled, Z Su
International Conference on Foundations of Software Science and Computation …, 1998
155 1998 Message sequence graphs and decision problems on Mazurkiewicz traces A Muscholl, D Peled
International Symposium on Mathematical Foundations of Computer Science, 81-91, 1999
149 1999 Counting in trees for free H Seidl, T Schwentick, A Muscholl, P Habermehl
International Colloquium on Automata, Languages, and Programming, 1136-1149, 2004
109 2004 Compositional message sequence charts EL Gunter, A Muscholl, DA Peled
International Conference on Tools and Algorithms for the Construction and …, 2001
98 2001 A Kleene theorem and model checking algorithms for existentially bounded communicating automata B Genest, D Kuske, A Muscholl
Information and Computation 204 (6), 920-956, 2006
96 2006 Numerical document queries H Seidl, T Schwentick, A Muscholl
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on …, 2003
95 2003 Computing C Hagenah, A Muscholl
RAIRO-Theoretical Informatics and Applications-Informatique Théorique et …, 2000
73 * 2000 Logical definability on infinite traces W Ebinger, A Muscholl
Theoretical Computer Science 154 (1), 67-84, 1996
71 1996 A lower bound on web services composition A Muscholl, I Walukiewicz
International Conference on Foundations of Software Science and …, 2007
68 2007 Synthesis of distributed algorithms using asynchronous automata A Ştefănescu, J Esparza, A Muscholl
International Conference on Concurrency Theory, 27-41, 2003
56 2003 Infinite-state high-level MSCs: Model-checking and realizability B Genest, A Muscholl, H Seidl, M Zeitoun
Journal of Computer and System Sciences 72 (4), 617-647, 2006
55 2006 Bounded MSC communication M Lohrey, A Muscholl
Information and Computation 189 (2), 160-181, 2004
49 2004 Infinite-state high-level MSCs: Model-checking and realizability B Genest, A Muscholl, H Seidl, M Zeitoun
International Colloquium on Automata, Languages, and Programming, 657-668, 2002
48 2002 On communicating automata with bounded channels B Genest, D Kuske, A Muscholl
Fundamenta Informaticae 80 (1-3), 147-167, 2007
46 2007 Characterizations of classes of graphs recognizable by local computations E Godard, Y Métivier, A Muscholl
Theory of Computing Systems 37 (2), 249-293, 2004
41 2004 Logical definability on infinite traces W Ebinger, A Muscholl
International Colloquium on Automata, Languages, and Programming, 335-346, 1993
40 1993 Reachability analysis of communicating pushdown systems A Heußner, J Leroux, A Muscholl, G Sutre
International Conference on Foundations of Software Science and …, 2010
39 2010 
Thomas SchwentickProfessor of Computer Science, TU Dortmund UniversityBestätigte E-Mail-Adresse bei udo.edu
