We study decidability issues for reachability problems in graph transformation systems, a powerful infinite-state model. For a fixed initial configuration, we consider reachability of an entirely… (More)

Given a transition system and a partial order on its states, the coverability problem is the question to decide whether a state can be reached that is larger than some given state. For graphs, a… (More)

We introduce a new class of graph transformation systems in w h ch rewrite rules can be guarded by universally quantified condi tions on the neighbourhood of nodes. These conditions are defined via… (More)

Graph transformation systems (GTSs) can be seen as wellstructured transition systems (WSTSs), thus obtaining decidability results for certain classes of GTSs. In earlier work it was shown that… (More)

UNCOVER is a tool for high level verification of distributed or concurrent systems. It uses graphs and graph transformation rules to model these systems in a natural way. Errors in such a system are… (More)

Adaptable user interfaces (UI) have shown a great variety of advantages in human computer interaction compared to classic UI designs. We show how adaptable UIs can be built by introducing coloured… (More)

The aim of this thesis is the definition of a high-level framework for verifying concurrent and distributed systems. Verification in computer science is challenging, since models that are… (More)

We describe a concrete construction of all pushout complements for two given morphisms f : A → B, m : B → D in the category of hypergraphs, valid also for the case where f, m are non-injective. To… (More)

We present an algorithmic view of graph transformation systems, a powerful infinitestate system model, obtained through a study of decidability issues for reachability problems. For a fixed initial… (More)