The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Anca Muscholl: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  56. Tree Pattern Rewriting Systems. [Citation Graph (, )][DBLP]


  57. Taming Distributed Asynchronous Systems. [Citation Graph (, )][DBLP]


  58. Reachability Analysis of Communicating Pushdown Systems. [Citation Graph (, )][DBLP]


  59. Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata. [Citation Graph (, )][DBLP]


  60. Analysis of Communicating Automata. [Citation Graph (, )][DBLP]


  61. A lower bound on web services composition [Citation Graph (, )][DBLP]


  62. Verifying Recursive Active Documents with Positive Data Tree Rewriting [Citation Graph (, )][DBLP]


Search in 0.073secs, Finished in 0.076secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002