This work treats the problem of error-resilient DNA searching via oblivious evaluation of finite automata, formulated as follows: a client has a DNA sequence, and a service provid...
In this paper we model the growth of living plants in a discrete approach, the graph automata based plant model representing each metamer of the plant as node of the automata. The...
Parallelism constraints are logical descriptions of trees. Parallelism constraints subsume dominance constraints and are equal in expressive power to context unification. Paralleli...
Abstract. Recently, there have been a number of proposals for languages for expressing web service constraints and capabilities, with WSPolicy and WSPL leading the way. The propose...
Vladimir Kolovski, Bijan Parsia, Yarden Katz, Jame...
Connectors have emerged as a powerful concept for composition and coordination of concurrent activities encapsulated as components and services. Compositional coordination models a...
Farhad Arbab, Tom Chothia, Sun Meng, Young-Joo Moo...