The following pages link to Anca Muscholl (Q407517):
Displaying 50 items.
- A quadratic construction for Zielonka automata with acyclic communication structure (Q407518) (← links)
- Walking on data words (Q504989) (← links)
- A note on the commutative closure of star-free languages (Q672729) (← links)
- Logical definability on infinite traces (Q672860) (← links)
- Complementing deterministic tree-walking automata (Q845667) (← links)
- Permutation rewriting and algorithmic verification (Q865624) (← links)
- Controlling loosely cooperating processes (Q896910) (← links)
- Pattern matching and membership for hierarchical message sequence charts (Q927396) (← links)
- Deterministic asynchronous automata for infinite traces (Q1338892) (← links)
- On the complementation of asynchronous cellular Büchi automata (Q1349891) (← links)
- The code problem for traces -- improving the boundaries (Q1392032) (← links)
- A tour of recent results on word transducers (Q1679952) (← links)
- Characterizations of classes of graphs recognizable by local computations (Q1879372) (← links)
- Bounded MSC communication (Q1881218) (← links)
- Solving word equations modulo partial commutations (Q1960424) (← links)
- Model-checking linear-time properties of parametrized asynchronous shared-memory pushdown systems (Q2164219) (← links)
- One-way resynchronizability of word transducers (Q2233399) (← links)
- Communicating automata (Q2244826) (← links)
- Active context-free games (Q2432536) (← links)
- Infinite-state high-level MSCs: model-checking and realizability (Q2495403) (← links)
- A Kleene theorem and model checking algorithms for existentially bounded communicating automata (Q2496297) (← links)
- Abstraction-based control synthesis using partial information (Q2667508) (← links)
- (Q2769610) (← links)
- A Note on Monitors and Büchi Automata (Q2787415) (← links)
- Unlimited Decidability of Distributed Synthesis with Limited Missing Knowledge (Q2849954) (← links)
- (Q2908878) (← links)
- On Distributed Monitoring of Asynchronous Systems (Q2915018) (← links)
- Two-variable logic on data words (Q2946646) (← links)
- Reachability for Dynamic Parametric Processes (Q2961580) (← links)
- Distributed synthesis for acyclic architectures (Q2978553) (← links)
- (Q3044337) (← links)
- (Q3086934) (← links)
- (Q3130542) (← links)
- On Distributed Monitoring and Synthesis (Q3195680) (← links)
- SOLVABILITY OF EQUATIONS IN GRAPH GROUPS IS DECIDABLE (Q3430310) (← links)
- Automated Synthesis of Distributed Controllers (Q3449462) (← links)
- Two-variable logic on data trees and XML reasoning (Q3452211) (← links)
- (Q3504343) (← links)
- A lower bound on web services composition (Q3518281) (← links)
- Tree Pattern Rewriting Systems (Q3540083) (← links)
- Analysis of Communicating Automata (Q3564848) (← links)
- Taming Distributed Asynchronous Systems (Q3584920) (← links)
- Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata (Q3587426) (← links)
- Constructing Exponential-Size Deterministic Zielonka Automata (Q3591422) (← links)
- (Q4218104) (← links)
- (Q4281564) (← links)
- (Q4375801) (← links)
- (Q4502806) (← links)
- (Q4535046) (← links)
- (Q4535059) (← links)
