Since the systematic evolution of graph-like program models has become important in software engineering, graph transformation has gained much attention in this area. For specifying model evolution concisely, graph transformation rules should be as expressive as possible. The generic rules proposed in this paper may contain placeholders for graphs of varying number and shape. Expansion of these...

Hierarchical Graph Transformation Gio r g i o Bu s a t t o Carl v. Ossietzky Universität Fachbereich Informatik 26111 Oldenburg email: [email protected] Han s J ö r g K r e ow sk i, S ab i n e Ku sk e University of Bremen Department of Computer Science P.O. Box 330440 D-28334 Bremen email: {kreo,kuske}@informatik.uni-bremen.de

Hierarchically distributed graph transformation ooers means to model diierent aspects of open distributed systems very intuitively in a graphical way. The distribution topology as well as local object structures are represented graphically. Distributed actions such as local actions, network activities, communication and synchronization can be described homogeneously using the same method: graph...

Graph Transformation Arend Rensink Department of Computer Science, University of Twente [email protected] Dino Distefano Department of Computer Science, Queen Mary University of London [email protected] January 31, 2005 Abstract Graphs may be used as representations of system states in operational semantics and model checking; in the latter context, they are being investigated as an alte...

Variables make rule-based systems more abstract and expressive, as witnessed by term rewriting systems and two-level grammars. In this paper we show that variables can be used to define advanced ways of graph transformation as well. Taking the gluing approach to graph transformation [7, 3] as a basis, we consider extensions of rules with attribute variables, clone variables, and graph variables...

Behavior specification techniques like Petri nets provide a visual description of software and embedded systems as basis for behavior validation by simulation. Graph transformation systems can be used as a unifying formal approach to define various visual behavior modeling languages including different kinds of Petri nets, activity diagrams, Statecharts etc., and to provide models with an opera...

In this tutorial, some basic ideas will be outlined and exempliied how graph transformation can be employed in speciication and programming. In particular, some of the respective achievements of the COMPUGRAPH project will be pointed out. Graphs are widely used in many areas of Computer Science and beyond to describe complex system states, structured objects, networks and relations among compon...

In general, it is undecidable whether a terminating graphtransformation system is confluent or not. We introduce the class of coverable hypergraph-transformation systems and show that confluence is decidable for coverable systems that are terminating. Intuitively, a system is coverable if its typing allows to extend each critical pair with a non-deletable context that uniquely identifies the pe...

In the recent years, extensions of graph transformation systems with quantitative properties, such as real-time and stochastic behavior received considerable attention. In this paper, we describe the new quantitative modeling approach of probabilistic graph transformation systems (PGTSs) which incorporate probabilistic behavior into graph transformation systems. Among other applications, PGTSs ...

In distributed and mobile systems with volatile bandwidth and fragile connectivity, non-functional aspects like performance and reliability become more and more important. To formalize, measure, and predict such properties, stochastic methods are required. At the same time such systems are characterized by a high degree of architectural reconfiguration. Viewing the architecture of a distributed...