| 2008 |
|---|
| 59 | EE | Blaise Genest,
Anca Muscholl,
Olivier Serre,
Marc Zeitoun:
Tree Pattern Rewriting Systems.
ATVA 2008: 332-346 |
| 58 | EE | Anca Muscholl,
Igor Walukiewicz:
A lower bound on web services composition
CoRR abs/0804.3105: (2008) |
| 57 | EE | Blaise Genest,
Anca Muscholl:
Pattern Matching and Membership for Hierarchical Message Sequence Charts.
Theory Comput. Syst. 42(4): 536-567 (2008) |
| 2007 |
|---|
| 56 | EE | Anca Muscholl,
Igor Walukiewicz:
A Lower Bound on Web Services Composition.
FoSSaCS 2007: 274-286 |
| 55 | EE | Blaise Genest,
Dietrich Kuske,
Anca Muscholl:
On Communicating Automata with Bounded Channels.
Fundam. Inform. 80(1-3): 147-167 (2007) |
| 54 | EE | Ahmed Bouajjani,
Anca Muscholl,
Tayssir Touili:
Permutation rewriting and algorithmic verification.
Inf. Comput. 205(2): 199-224 (2007) |
| 2006 |
|---|
| 53 | EE | Blaise Genest,
Anca Muscholl:
Constructing Exponential-Size Deterministic Zielonka Automata.
ICALP (2) 2006: 565-576 |
| 52 | EE | Mikolaj Bojanczyk,
Anca Muscholl,
Thomas Schwentick,
Luc Segoufin,
Claire David:
Two-Variable Logic on Words with Data.
LICS 2006: 7-16 |
| 51 | EE | Mikolaj Bojanczyk,
Claire David,
Anca Muscholl,
Thomas Schwentick,
Luc Segoufin:
Two-variable logic on data trees and XML reasoning.
PODS 2006: 10-19 |
| 50 | EE | Volker Diekert,
Anca Muscholl:
Solvability of Equations in Graph Groups Is Decidable.
IJAC 16(6): 1047-1070 (2006) |
| 49 | EE | 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) |
| 48 | EE | Anca Muscholl,
Mathias Samuelides,
Luc Segoufin:
Complementing deterministic tree-walking automata.
Inf. Process. Lett. 99(1): 33-39 (2006) |
| 47 | EE | 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) |
| 46 | EE | Anca Muscholl,
Thomas Schwentick,
Luc Segoufin:
Active Context-Free Games.
Theory Comput. Syst. 39(1): 237-276 (2006) |
| 2005 |
|---|
| 45 | EE | Blaise Genest,
Anca Muscholl:
Message Sequence Charts: A Survey.
ACSD 2005: 2-4 |
| 44 | EE | Blaise Genest,
Dietrich Kuske,
Anca Muscholl,
Doron Peled:
Snapshot Verification.
TACAS 2005: 510-525 |
| 43 | EE | Anca Muscholl,
Igor Walukiewicz:
An NP-complete fragment of LTL.
Int. J. Found. Comput. Sci. 16(4): 743-753 (2005) |
| 2004 |
|---|
| 42 | EE | 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 |
| 41 | EE | Anca Muscholl,
Igor Walukiewicz:
An NP-Complete Fragment of LTL.
Developments in Language Theory 2004: 334-344 |
| 40 | EE | Blaise Genest,
Marius Minea,
Anca Muscholl,
Doron Peled:
Specifying and Verifying Partial Order Properties Using Template MSCs.
FoSSaCS 2004: 195-210 |
| 39 | EE | Helmut Seidl,
Thomas Schwentick,
Anca Muscholl,
Peter Habermehl:
Counting in Trees for Free.
ICALP 2004: 1136-1149 |
| 38 | EE | Anca Muscholl,
Thomas Schwentick,
Luc Segoufin:
Active Context-Free Games.
STACS 2004: 452-464 |
| 37 | EE | Markus Lohrey,
Anca Muscholl:
Bounded MSC communication.
Inf. Comput. 189(2): 160-181 (2004) |
| 36 | EE | Emmanuel Godard,
Yves Métivier,
Anca Muscholl:
Characterizations of Classes of Graphs Recognizable by Local Computations.
Theory Comput. Syst. 37(2): 249-293 (2004) |
| 2003 |
|---|
| 35 | EE | Alin Stefanescu,
Javier Esparza,
Anca Muscholl:
Synthesis of Distributed Algorithms Using Asynchronous Automata.
CONCUR 2003: 27-41 |
| 34 | EE | Blaise Genest,
Loïc Hélouët,
Anca Muscholl:
High-Level Message Sequence Charts and Projections.
CONCUR 2003: 308-322 |
| 33 | EE | Blaise Genest,
Anca Muscholl,
Doron Peled:
Message Sequence Charts.
Lectures on Concurrency and Petri Nets 2003: 537-558 |
| 32 | EE | Helmut Seidl,
Thomas Schwentick,
Anca Muscholl:
Numerical document queries.
PODS 2003: 155-166 |
| 31 | EE | Anca Muscholl,
Doron Peled:
Deciding Properties of Message Sequence Charts.
Scenarios: Models, Transformations and Tools 2003: 43-65 |
| 30 | EE | Elsa L. Gunter,
Anca Muscholl,
Doron Peled:
Compositional message sequence charts.
STTT 5(1): 78-89 (2003) |
| 2002 |
|---|
| 29 | EE | Markus Lohrey,
Anca Muscholl:
Bounded MSC Communication.
FoSSaCS 2002: 295-309 |
| 28 | EE | Blaise Genest,
Anca Muscholl,
Helmut Seidl,
Marc Zeitoun:
Infinite-State High-Level MSCs: Model-Checking and Realizability.
ICALP 2002: 657-668 |
| 27 | EE | Blaise Genest,
Anca Muscholl:
Pattern Matching and Membership for Hierarchical Message Sequence Charts.
LATIN 2002: 326-340 |
| 26 | EE | Benoît Caillaud,
Anca Muscholl:
Preface.
Electr. Notes Theor. Comput. Sci. 65(7): (2002) |
| 2001 |
|---|
| 25 | EE | Volker Diekert,
Anca Muscholl:
Solvability of Equations in Free Partially Commutative Groups Is Decidable.
ICALP 2001: 543-554 |
| 24 | EE | Anca Muscholl,
Doron Peled:
From Finite State Communication Protocols to High-Level Message Sequence Charts.
ICALP 2001: 720-731 |
| 23 | | Ahmed Bouajjani,
Anca Muscholl,
Tayssir Touili:
Permutation Rewriting and Algorithmic Verification.
LICS 2001 |
| 22 | EE | Elsa L. Gunter,
Anca Muscholl,
Doron Peled:
Compositional Message Sequence Charts.
TACAS 2001: 496-511 |
| 2000 |
|---|
| 21 | | Anca Muscholl,
Doron Peled:
Analyzing Message Sequence Charts.
SAM 2000: 3-17 |
| 20 | | Christian Hagenah,
Anca Muscholl:
Computing epsilon-free NFA from regular expressions in O(n log2(n)) time.
ITA 34(4): 257-278 (2000) |
| 1999 |
|---|
| 19 | | Anca Muscholl:
Matching Specifications for Message Sequence Charts.
FoSSaCS 1999: 273-287 |
| 18 | | Anca Muscholl,
Doron Peled:
Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces.
MFCS 1999: 81-91 |
| 17 | EE | Volker Diekert,
Yuri Matiyasevich,
Anca Muscholl:
Solving Word Equations modulo Partial Commutations.
Theor. Comput. Sci. 224(1-2): 215-235 (1999) |
| 1998 |
|---|
| 16 | EE | Anca Muscholl,
Doron Peled,
Zhendong Su:
Deciding Properties for Message Sequence Charts.
FoSSaCS 1998: 226-242 |
| 15 | EE | Christian Hagenah,
Anca Muscholl:
Computing epsilon-Free NFA from Regular Expressions in O(n log²(n)) Time.
MFCS 1998: 277-285 |
| 14 | | Emmanuel Godard,
Yves Métivier,
Anca Muscholl:
The Power of Local Computations in Graphs with Initial Knowledge.
TAGT 1998: 71-84 |
| 1997 |
|---|
| 13 | | Volker Diekert,
Yuri Matiyasevich,
Anca Muscholl:
Solving Trace Equations Using Lexicographical Normal Forms.
ICALP 1997: 336-346 |
| 12 | | Yves Métivier,
Anca Muscholl,
Pierre-André Wacrenier:
About the local detection of termination of local computations in graphs.
SIROCCO 1997: 188-200 |
| 11 | EE | Hendrik Jan Hoogeboom,
Anca Muscholl:
The Code Problem for Traces - Improving the Boundaries.
Theor. Comput. Sci. 172(1-2): 309-321 (1997) |
| 1996 |
|---|
| 10 | | Volker Diekert,
Anca Muscholl:
Code Problems on Traces.
MFCS 1996: 2-17 |
| 9 | | Volker Diekert,
Anca Muscholl:
A Note on Métivier's Construction of Asynchronous Automata for Triangulated Graphs.
Fundam. Inform. 25(3): 241-246 (1996) |
| 8 | EE | Anca Muscholl,
Holger Petersen:
A Note on the Commutative Closure of Star-Free Languages.
Inf. Process. Lett. 57(2): 71-74 (1996) |
| 7 | EE | Werner Ebinger,
Anca Muscholl:
Logical Definability on Infinite Traces.
Theor. Comput. Sci. 154(1): 67-84 (1996) |
| 6 | EE | Anca Muscholl:
On the Complementation of Asynchronous Cellular Büchi Automata.
Theor. Comput. Sci. 169(2): 123-145 (1996) |
| 1995 |
|---|
| 5 | | Volker Diekert,
Anca Muscholl,
Klaus Reinhardt:
On Codings of Traces.
STACS 1995: 385-396 |
| 1994 |
|---|
| 4 | | Anca Muscholl:
On the Complementation of Büchi Asynchronous Cellular Automata.
ICALP 1994: 142-153 |
| 3 | | Volker Diekert,
Anca Muscholl:
Deterministic Asynchronous Automata for Infinite Traces.
Acta Inf. 31(4): 379-397 (1994) |
| 1993 |
|---|
| 2 | | Werner Ebinger,
Anca Muscholl:
Logical Definability on Infinite Traces.
ICALP 1993: 335-346 |
| 1 | | Volker Diekert,
Anca Muscholl:
Deterministic Asynchronous Automata for Infinite Traces.
STACS 1993: 617-628 |
