The Dendroidal Process Calculus (DPC) is designed as a new theory for modeling concurrent and distributed computations and systems, equipped with a non-sequential and compositional semantics. In this theory, a parallel composition is parameterized by a graph at the vertices of which subprocesses are located. Communication is allowed only between subprocesses related by an edge in this graph. Mo...

Treebag is a software for experimenting with formal models in Computer Science, one type of such models being tree transducers. Tree transducers translate input trees to output trees, a mechanism used in e.g. compilers and picture generation. The top-down tree transducer is one of the formal models implemented as a component in Treebag. Compared to the top-down tree transducer, the macro tree t...

Extended multi bottom-up tree transducers are de ned and investigated. They are an extension of multi bottom-up tree transducers by arbitrary, not just shallow, left-hand sides of rules; this includes rules that do not consume input. It is shown that such transducers can compute all transformations that are computed by linear extended top-down tree transducers (which are a theoretical model for...

In this survey, several model of tree transducers are investigated with respect to properties that are relevant in machine translation. These properties include: suitable expressiveness, symmetry, preservation of regularity, and closure under composition. For three tree transducer models, top-down tree transducers, extended top-down tree transducers, and extended multi bottom-up tree transducer...

We introduce a novel automata-theoretic approach for the verification of multi-agent systems. We present epistemic alternating tree automata, an extension of alternating tree automata, and use them to represent specifications in the temporal-epistemic logic CTLK. We show that model checking a memory-less interpreted system against a CTLK property can be reduced to checking the language non-empt...