We study the problem of maintaining recursively-de ned views, such as the transitive closure of a relation, in traditional relational languages that do not have recursion mechanis...
We address the problem of deciding uniformly for graphs or languages of a given class whether they are generated by unlabelled Place-Transition nets whose sets of reachable marking...
Coalgebras for a functor on the category of sets subsume many formulations of the notion of transition system, including labelled transition systems, Kripke models, Kripke frames a...
The standard way of lifting a binary relation, R, from closed terms of an algebra to open terms is to de ne its closed-instance extension, Rci, which holds for a given pair of ope...
Abstract More attention is being paid to the development of information and communication technologies (ICTs) that are sensitive to the needs of people in their homes. By studying ...