| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Anca Muscholl Blaise Genest , Marius Minea , Anca Muscholl, Doron Peled : Specifying and Verifying Partial Order Properties Using Template MSCs. FoSSaCS 2004 : 195-210 Anca Muscholl, Thomas Schwentick , Luc Segoufin : Active Context-Free Games. STACS 2004 : 452-464 Alin Stefanescu , Javier Esparza , Anca Muscholl: Synthesis of Distributed Algorithms Using Asynchronous Automata. CONCUR 2003 : 27-41 Blaise Genest , Loïc Hélouet , Anca Muscholl: High-Level Message Sequence Charts and Projections. CONCUR 2003 : 308-322 Helmut Seidl , Thomas Schwentick , Anca Muscholl: Numerical document queries. PODS 2003 : 155-166 Elsa L. Gunter , Anca Muscholl, Doron Peled : Compositional message sequence charts. STTT 5 (1): 78-89 (2003) Markus Lohrey , Anca Muscholl: Bounded MSC Communication. FoSSaCS 2002 : 295-309 Blaise Genest , Anca Muscholl, Helmut Seidl , Marc Zeitoun : Infinite-State High-Level MSCs: Model-Checking and Realizability. ICALP 2002 : 657-668 Blaise Genest , Anca Muscholl: Pattern Matching and Membership for Hierarchical Message Sequence Charts. LATIN 2002 : 326-340 Benoît Caillaud , Anca Muscholl: Preface. Electr. Notes Theor. Comput. Sci. 65 (7): (2002) Volker Diekert , Anca Muscholl: Solvability of Equations in Free Partially Commutative Groups Is Decidable. ICALP 2001 : 543-554 Anca Muscholl, Doron Peled : From Finite State Communication Protocols to High-Level Message Sequence Charts. ICALP 2001 : 720-731 Ahmed Bouajjani , Anca Muscholl, Tayssir Touili : Permutation Rewriting and Algorithmic Verification. LICS 2001 Elsa L. Gunter , Anca Muscholl, Doron Peled : Compositional Message Sequence Charts. TACAS 2001 : 496-511 Anca Muscholl, Doron Peled : Analyzing Message Sequence Charts. SAM 2000 : 3-17 Christian Hagenah , Anca Muscholl: Computing epsilon-free NFA from regular expressions in O(n log 2 (n)) time. ITA 34 (4): 257-278 (2000) Anca Muscholl: Matching Specifications for Message Sequence Charts. FoSSaCS 1999 : 273-287 Anca Muscholl, Doron Peled : Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces. MFCS 1999 : 81-91 Volker Diekert , Yuri Matiyasevich , Anca Muscholl: Solving Word Equations modulo Partial Commutations. Theor. Comput. Sci. 224 (1-2): 215-235 (1999) Anca Muscholl, Doron Peled , Zhendong Su : Deciding Properties for Message Sequence Charts. FoSSaCS 1998 : 226-242 Christian Hagenah , Anca Muscholl: Computing epsilon-Free NFA from Regular Expressions in O(n log²(n)) Time. MFCS 1998 : 277-285 Emmanuel Godard , Yves Métivier , Anca Muscholl: The Power of Local Computations in Graphs with Initial Knowledge. TAGT 1998 : 71-84 Volker Diekert , Yuri Matiyasevich , Anca Muscholl: Solving Trace Equations Using Lexicographical Normal Forms. ICALP 1997 : 336-346 Yves Métivier , Anca Muscholl, Pierre-André Wacrenier : About the local detection of termination of local computations in graphs. SIROCCO 1997 : 188-200 Hendrik Jan Hoogeboom , Anca Muscholl: The Code Problem for Traces - Improving the Boundaries. Theor. Comput. Sci. 172 (1-2): 309-321 (1997) Volker Diekert , Anca Muscholl: Code Problems on Traces. MFCS 1996 : 2-17 Volker Diekert , Anca Muscholl: A Note on Métivier's Construction of Asynchronous Automata for Triangulated Graphs. Fundam. Inform. 25 (3): 241-246 (1996) Anca Muscholl, Holger Petersen : A Note on the Commutative Closure of Star-Free Languages. Inf. Process. Lett. 57 (2): 71-74 (1996) Werner Ebinger , Anca Muscholl: Logical Definability on Infinite Traces. Theor. Comput. Sci. 154 (1): 67-84 (1996) Anca Muscholl: On the Complementation of Asynchronous Cellular Büchi Automata. Theor. Comput. Sci. 169 (2): 123-145 (1996) Volker Diekert , Anca Muscholl, Klaus Reinhardt : On Codings of Traces. STACS 1995 : 385-396 Anca Muscholl: On the Complementation of Büchi Asynchronous Cellular Automata. ICALP 1994 : 142-153 Volker Diekert , Anca Muscholl: Deterministic Asynchronous Automata for Infinite Traces. Acta Inf. 31 (4): 379-397 (1994) Werner Ebinger , Anca Muscholl: Logical Definability on Infinite Traces. ICALP 1993 : 335-346 Volker Diekert , Anca Muscholl: Deterministic Asynchronous Automata for Infinite Traces. STACS 1993 : 617-628 1 [ 23 ] 2 [ 26 ] 3 [ 1 ] [ 3 ] [ 5 ] [ 9 ] [ 10 ] [ 13 ] [ 17 ] [ 25 ] 4 [ 2 ] [ 7 ] 5 [ 33 ] 6 [ 27 ] [ 28 ] [ 32 ] [ 35 ] 7 [ 14 ] 8 [ 22 ] [ 30 ] 9 [ 15 ] [ 20 ] 10 [ 32 ] 11 [ 11 ] 12 [ 29 ] 13 [ 13 ] [ 17 ] 14 [ 12 ] [ 14 ] 15 [ 35 ] 16 [ 16 ] [ 18 ] [ 21 ] [ 22 ] [ 24 ] [ 30 ] [ 35 ] 17 [ 8 ] 18 [ 5 ] 19 [ 31 ] [ 34 ] 20 [ 34 ] 21 [ 28 ] [ 31 ] 22 [ 33 ] 23 [ 16 ] 24 [ 23 ] 25 [ 12 ] 26 [ 28 ]  ©2004 Association for Computing Machinery |
