The world is increasingly populated with interactive agents distributed in space, real or
abstract. These agents can be artificial, as in computing systems that manage and monitor …

This paper describes the use of statistical techniques and hidden Markov models (HMM) in
the recognition of emotions. The method aims to classify 6 basic emotions (anger, dislike …

We show that the generic symmetric monoidal category with a commutative separable
algebra which has a Σ-family of actions is the category of cospans of finite Σ-labelled graphs …

Bigraphs are graphs whose nodes may be nested, representing locality, independently of
the edges connecting them. They may be equipped with reaction rules, forming a …

A bigraphical reactive system (BRS) involves bigraphs, in which the nesting of nodes
represents locality, independently of the edges connecting them; it also allows bigraphs to …

Writing in a second language is a complex activity requiring proficiency in a number of
different areas. l Writing programmes often focus on particular areas of skill and knowledge …

Bigraphs are a framework in which both existing process calculi and new models of
behaviour can be formulated, yielding theory that is shared among these models. A short …

The theory of reactive systems, introduced by Leifer and Milner and previously extended by
the authors, allows the derivation of well-behaved labelled transition systems (LTS) for …

Graph grammars (or graph transformation systems), originally introduced as a
generalization of string grammars, can be seen as a powerful formalism for the specification …

A framework is defined within which reactive systems can be studied formally. The
framework is based on s-categories, which are a new variety of categories within which …