Travelled to:1 × Cyprus
1 × Finland
1 × Greece
1 × Israel
1 × Japan
1 × Latvia
1 × New Zealand
1 × Sweden
1 × The Netherlands
1 × United Kingdom
2 × France
2 × Germany
2 × Portugal
2 × Spain
3 × Italy
4 × USA
Collaborated with:∅ I.Walukiewicz B.Genest D.Peled T.Schwentick H.Seidl V.Diekert D.Kuske H.Gimbert M.Lohrey W.Ebinger M.Bojanczyk L.Segoufin C.David A.Bouajjani T.Touili E.L.Gunter Z.Su E.Godard Y.Métivier Y.Matiyasevich M.Fortin A.Heußner J.Leroux G.Sutre M.Minea P.Habermehl M.Zeitoun
Talks about:communic (5) automata (5) asynchron (4) sequenc (4) messag (4) chart (4) properti (3) logic (3) tree (3) determinist (2)
Person: Anca Muscholl
DBLP: Muscholl:Anca
Facilitated 2 volumes:
Ed
EdContributed to:
2015201320102010
201020072006
2006
2006
2005
200420052004200420032002200220012001200119991998
19981997199419932016
2017Wrote 30 papers:
- ICALP-v2-2015-Muscholl #automation #distributed #synthesis
- Automated Synthesis of Distributed Controllers (AM), pp. 11–27.
- ICALP-v2-2013-GenestGMW #architecture #game studies
- Asynchronous Games over Tree Architectures (BG, HG, AM, IW), pp. 275–286.
- FoSSaCS-2010-HeussnerLMS #analysis #automaton #communication #reachability
- Reachability Analysis of Communicating Pushdown Systems (AH, JL, AM, GS), pp. 267–281.
- ICALP-v2-2010-GenestGMW #automaton
- Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata (BG, HG, AM, IW), pp. 52–63.
- LATA-2010-Muscholl #analysis #automaton #communication
- Analysis of Communicating Automata (AM), pp. 50–57.
- FoSSaCS-2007-MuschollW #bound #composition #web #web service
- A Lower Bound on Web Services Composition (AM, IW), pp. 274–286.
- ICALP-v2-2006-GenestM #automaton
- Constructing Exponential-Size Deterministic Zielonka Automata (BG, AM), pp. 565–576.
- LICS-2006-BojanczykMSSD #logic #word
- Two-Variable Logic on Words with Data (MB, AM, TS, LS, CD), pp. 7–16.
- PODS-2006-BojanczykDMSS #logic #reasoning #xml
- Two-variable logic on data trees and XML reasoning (MB, CD, AM, TS, LS), pp. 10–19.
- TACAS-2005-GenestKMP #verification
- Snapshot Verification (BG, DK, AM, DP), pp. 510–525.
- DLT-2004-GenestMK #algorithm #automaton #communication #effectiveness #theorem
- A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms (BG, AM, DK), pp. 30–48.
- DLT-2004-MuschollW #ltl
- An NP-Complete Fragment of LTL (AM, IW), pp. 334–344.
- DLT-J-2004-MuschollW05 #ltl
- An NP-complete fragment of LTL (AM, IW), pp. 743–753.
- FoSSaCS-2004-GenestMMP #partial order #specification #using #verification
- Specifying and Verifying Partial Order Properties Using Template MSCs (BG, MM, AM, DP), pp. 195–210.
- ICALP-2004-SeidlSMH #for free
- Counting in Trees for Free (HS, TS, AM, PH), pp. 1136–1149.
- PODS-2003-SeidlSM #documentation #query
- Numerical document queries (HS, TS, AM), pp. 155–166.
- FoSSaCS-2002-LohreyM #bound #communication
- Bounded MSC Communication (ML, AM), pp. 295–309.
- ICALP-2002-GenestMSZ #infinity #model checking
- Infinite-State High-Level MSCs: Model-Checking and Realizability (BG, AM, HS, MZ), pp. 657–668.
- ICALP-2001-DiekertM #commutative #decidability #equation
- Solvability of Equations in Free Partially Commutative Groups Is Decidable (VD, AM), pp. 543–554.
- ICALP-2001-MuschollP #communication #finite #protocol #sequence chart
- From Finite State Communication Protocols to High-Level Message Sequence Charts (AM, DP), pp. 720–731.
- LICS-2001-BouajjaniMT #algorithm #permutation #verification
- Permutation Rewriting and Algorithmic Verification (AB, AM, TT), pp. 399–408.
- TACAS-2001-GunterMP #composition #sequence chart
- Compositional Message Sequence Charts (ELG, AM, DP), pp. 496–511.
- FoSSaCS-1999-Muscholl #sequence chart #specification
- Matching Specifications for Message Sequence Charts (AM), pp. 273–287.
- FoSSaCS-1998-MuschollPS #sequence chart
- Deciding Properties for Message Sequence Charts (AM, DP, ZS), pp. 226–242.
- TAGT-1998-GodardMM #graph #power of
- The Power of Local Computations in Graphs with Initial Knowledge (EG, YM, AM), pp. 71–84.
- ICALP-1997-DiekertMM #equation #normalisation #using
- Solving Trace Equations Using Lexicographical Normal Forms (VD, YM, AM), pp. 336–346.
- ICALP-1994-Muscholl #automaton #on the
- On the Complementation of Büchi Asynchronous Cellular Automata (AM), pp. 142–153.
- ICALP-1993-EbingerM #infinity #logic
- Logical Definability on Infinite Traces (WE, AM), pp. 335–346.
- CSL-2016-Muscholl #automation #distributed #synthesis
- Automated Synthesis: Going Distributed (AM), p. 2.
- CAV-2017-FortinMW #automaton #linear #model checking
- Model-Checking Linear-Time Properties of Parametrized Asynchronous Shared-Memory Pushdown Systems (MF, AM, IW), pp. 155–175.