Graph transformation or graph rewriting has been developed for nearly 50 years and has
become a mature and manifold formal technique. Basically, rewrite rules are used to …

Abstract Model transformations are a key concept within model driven development and
there is an enormous need for suitable formal analysis techniques for model …

Software models are the core development artifact in model-based engineering (MBE). The
MBE paradigm promotes the use of software models to describe structure and behavior of …

Abstract Model transformation is a prime technique in modern, model-driven software
design. One of the most challenging issues is to show that the semantics of the models is not …

Behavior preservation, namely the fact that the behavior of a model is not altered by the
transformations, is a crucial property in refactoring. The most common approaches to …

Reactive systems, proposed by Leifer and Milner, represent a meta-framework aimed at
deriving behavioral congruences for those specification formalisms whose operational …

We study nested conditions, a generalization of first-order logic to a categorical setting, and
provide a tableau-based (semi-decision) procedure for checking (un) satisfiability and finite …

We lift the notion of nested application conditions from graph transformation systems to the
general categorical setting of reactive systems as defined by Leifer and Milner. This serves …

We present the link-calculus, a process calculus based on interactions that are multiparty, ie,
that may involve more than two processes and are open, ie, the number of involved …

Graph transformation works under a whole-world assumption. In modelling realistic systems,
this typically makes for large graphs and sometimes also large, hard to understand rules …