Abstract Machine Greg Manning1 Detlef Plump2 Department of Computer Science The University of York, UK duce the York Abstract Machine (YAM) for implementing the graph programming ...
It has been claimed by many in the graph transformation community that model transformation, as understood in the context of Model Driven Architecture, can be seen as an applicati...
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
We define transactional graph transformation systems (t-gtss), a mild extension of the ordinary framework for the double-pushout approach to graph transformation, which allows to ...
Paolo Baldan, Andrea Corradini, Fernando Luí...
Towards a unifying model of concurrency, we have designed and implemented LMNtal (pronounced "elemental"), a model and language based on hierarchical graph rewriting tha...
Hybrid Chi is a process algebra for the modeling and analysis of hybrid systems. It enables modular specification of hybrid systems by means of a large set of atomic statements an...
Jos C. M. Baeten, Dirk A. van Beek, Pieter J. L. C...
The problem of "time separation" can be stated as follows: Given a system made of several connected components, each one entailing a local delay known with uncertainty, ...
We do not interact with systems without first performing some physical action on a physical device. This paper shows how formal notations and formal models can be developed to acc...
Alan J. Dix, Masitah Ghazali, Devina Ramduny-Ellis
Engineering natural and appropriate interactive behaviour in ubiquitous computing systems presents new challenges to their developers. This paper explores formal models of interac...