Results 1  10
of
24
Adhesive categories
, 2004
"... Abstract. We introduce adhesive categories, which are categories with structure ensuring that pushouts along monomorphisms are wellbehaved. Many types of graphical structures used in computer science are shown to be examples of adhesive categories. Doublepushout graph rewriting generalises well to ..."
Abstract

Cited by 59 (8 self)
 Add to MetaCart
(Show Context)
Abstract. We introduce adhesive categories, which are categories with structure ensuring that pushouts along monomorphisms are wellbehaved. Many types of graphical structures used in computer science are shown to be examples of adhesive categories. Doublepushout graph rewriting generalises well to rewriting on arbitrary adhesive categories.
Tutorial introduction to graph transformation: A software engineering perspective
 In Proc. of the First International Conference on Graph Transformation (ICGT 2002
, 2002
"... ..."
(Show Context)
ADHESIVE AND QUASIADHESIVE CATEGORIES
 THEORETICAL INFORMATICS AND APPLICATIONS
, 1999
"... We introduce adhesive categories, which are categories with structure ensuring that pushouts along monomorphisms are wellbehaved, as well as quasiadhesive categories which restrict attention to regular monomorphisms. Many examples of graphical structures used in computer science are shown to be ex ..."
Abstract

Cited by 55 (3 self)
 Add to MetaCart
We introduce adhesive categories, which are categories with structure ensuring that pushouts along monomorphisms are wellbehaved, as well as quasiadhesive categories which restrict attention to regular monomorphisms. Many examples of graphical structures used in computer science are shown to be examples of adhesive and quasiadhesive categories. Doublepushout graph rewriting generalizes well to rewriting on arbitrary adhesive and quasiadhesive categories.
Distributed Graph Transformation Units
 International Journal on Software Engineering and Knowledge Engineering
, 2002
"... Transformation units are a structuring principle for graph transformation systems. In this paper we introduce distributed transformation units that can be used to model distributed graph transformation systems. A distributed transformation unit consists of a set of local transformation units which a ..."
Abstract

Cited by 31 (23 self)
 Add to MetaCart
Transformation units are a structuring principle for graph transformation systems. In this paper we introduce distributed transformation units that can be used to model distributed graph transformation systems. A distributed transformation unit consists of a set of local transformation units which are connected via interface units. Semantically, a distributed transformation unit transforms distributed graphs consisting of a set of local graphs connected via interface graphs, in such a way that every local graph with its interfaces is transformed by a local transformation unit. Since the interface graphs can be modified concurrently by various local transformation units we introduce a concurrent semantics of transformation units. The presented concepts are illustrated with a running example of a simple game where two different actors access a common game board randomly.
Process Bisimulation via a Graphical Encoding
 IN: ICGT ‘06. VOLUME 4178 OF LNCS
, 2006
"... The paper presents a case study on the synthesis of labelled transition systems (ltss) for process calculi, choosing as testbed Milner’s Calculus of Communicating System (ccs). The proposal is based on a graphical encoding: each ccs process is mapped into a graph equipped with suitable interfaces, s ..."
Abstract

Cited by 20 (12 self)
 Add to MetaCart
(Show Context)
The paper presents a case study on the synthesis of labelled transition systems (ltss) for process calculi, choosing as testbed Milner’s Calculus of Communicating System (ccs). The proposal is based on a graphical encoding: each ccs process is mapped into a graph equipped with suitable interfaces, such that the denotation is fully abstract with respect to the usual structural congruence. Graphs with interfaces are amenable to the synthesis mechanism based on borrowed contexts (bcs), proposed by Ehrig and König (which are an instance of relative pushouts, originally introduced by Milner and Leifer). The bc mechanism allows the effective construction of an lts that has graphs with interfaces as both states and labels, and such that the associated bisimilarity is automatically a congruence. Our paper focuses on the analysis of the lts distilled by exploiting the encoding of ccs processes: besides offering some technical contributions towards the simplification of the bc mechanism, the key result of our work is the proof that the bisimilarity on processes obtained via bcs coincides with the standard strong bisimilarity for ccs.
Graph Transformation with Time: Causality and Logical Clocks
, 2003
"... Following TER nets, an approach to the modelling of time in highlevel Petri nets, we propose a model of time within (attributed) graph transformation systems where logical clocks are represented as distinguished node attributes. Corresponding axioms for the time model in TER nets are generalised ..."
Abstract

Cited by 19 (6 self)
 Add to MetaCart
(Show Context)
Following TER nets, an approach to the modelling of time in highlevel Petri nets, we propose a model of time within (attributed) graph transformation systems where logical clocks are represented as distinguished node attributes. Corresponding axioms for the time model in TER nets are generalised to graph transformation systems and semantic variations are discussed. They are summarised by a general theorem ensuring the consistency of temporal order and casual dependencies. The resulting
Graph Transformation as a Conceptual and Formal Framework for System . . .
 ICALP 2000
, 2000
"... Distributed software systems are typically built according to a three layer conceptual structure: Objects on the lowest layer are clustered by components on the second layer, which themselves are located at nodes of a computer network on the third layer. Orthogonal to these three layers, an instance ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
(Show Context)
Distributed software systems are typically built according to a three layer conceptual structure: Objects on the lowest layer are clustered by components on the second layer, which themselves are located at nodes of a computer network on the third layer. Orthogonal to these three layers, an instance level and a type or schema level are distinguished when modeling these systems. Accordingly, the changes a system experiences during its lifetime can be classied as the system’s dynamic behavior on the instance level and as the evolution of the system on the schema level. This paper shows how concepts from the area of graph transformation can be applied to provide a conceptual and formal framework for describing the structural and behavioral aspects of such systems.
Observing reductions in nominal calculi via a graphical encoding of processes
 Processes, terms and cycles (Klop Festschrift), volume 3838 of LNCS
"... Abstract. The paper introduces a novel approach to the synthesis of labelled transition systems for calculi with name mobility. The proposal is based on a graphical encoding: Each process is mapped into a (ranked) graph, such that the denotation is fully abstract with respect to the usual structural ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
(Show Context)
Abstract. The paper introduces a novel approach to the synthesis of labelled transition systems for calculi with name mobility. The proposal is based on a graphical encoding: Each process is mapped into a (ranked) graph, such that the denotation is fully abstract with respect to the usual structural congruence (i.e., two processes are equivalent exactly when the corresponding encodings yield the same graph). Ranked graphs are naturally equipped with a few algebraic operations, and they are proved to form a suitable (bi)category of cospans. Then, as proved by Sassone and Sobocinski, the synthesis mechanism based on relative pushout, originally proposed by Milner and Leifer, can be applied. The resulting labelled transition system has ranked graphs as both states and labels, and it induces on (encodings of) processes an observational equivalence that is reminiscent of early bisimilarity.
Improving the AgentOriented Modeling Process by roles
 The Fifth International Conference on Autonomous Agents, May 2001
"... The agentoriented modeling process is divided in a typical sequence of activities, i.e., requirements specification, analysis, and design. The requirements are specified by descriptions of the system’s functionality and by exemplary scenarios of essential interactions. In analysis the system’s st ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
(Show Context)
The agentoriented modeling process is divided in a typical sequence of activities, i.e., requirements specification, analysis, and design. The requirements are specified by descriptions of the system’s functionality and by exemplary scenarios of essential interactions. In analysis the system’s structure is captured and mandatory behavior of agents is prescribed. The design model describes system behavior by means of local operations. The problem arises how the transition between these different stages of the modeling process can be performed. In this paper, we introduce a concept of roles in order to support the transition in a systematic way and thereby improving the agentoriented modeling process.