Results 1 
4 of
4
Observational Equivalence for Synchronized Graph Rewriting with Mobility
, 2001
"... We introduce a notion of bisimulation for graph rewriting systems, allowing us to prove observational equivalence for dynamically evolving graphs and networks. We use the framework of synchronized graph rewriting with mobility which we describe in two different, but operationally equivalent ways: on ..."
Abstract

Cited by 10 (6 self)
 Add to MetaCart
We introduce a notion of bisimulation for graph rewriting systems, allowing us to prove observational equivalence for dynamically evolving graphs and networks. We use the framework of synchronized graph rewriting with mobility which we describe in two different, but operationally equivalent ways: on graphs defined as syntactic judgements and by using tile logic. One of the main results of the paper says that bisimilarity for synchronized graph rewriting is a congruence whenever the rewriting rules satisfy the basic source property. Furthermore we introduce an upto technique simplifying bisimilarity proofs and use it in an example to show the equivalence of a communication network and its specification.
Static Analysis of Distributed Systems with Mobility Specified by Graph Grammars  A Case Study
 PROC. OF IDPT ’02 (SIXTH INTERNATIONAL CONFERENCE ON INTEGRATED DESIGN & PROCESS TECHNOLOGY). SOCIETY FOR DESIGN AND PROCESS SCIENCE
, 2002
"... We consider a distributed system with mobility modelled as a graph transformation system. Then we show that nonsecure level processes cannot influence secure level processes, a property formalized as the absence of causal dependencies between such processes. This is done by resorting to an analysis ..."
Abstract

Cited by 7 (6 self)
 Add to MetaCart
We consider a distributed system with mobility modelled as a graph transformation system. Then we show that nonsecure level processes cannot influence secure level processes, a property formalized as the absence of causal dependencies between such processes. This is done by resorting to an analysis technique for graph transformation systems, called approximated unfolding, based on the construction of an approximation of the unfolding semantics.
Analysing Input/OutputCapabilities of Mobile Processes with a Generic Type System
 IN PROCEEDINGS OF THE 27TH INTERNATIONAL COLLOQUIUM ON AUTOMATA, LANGUAGES AND PROGRAMMING
, 2000
"... We introduce a generic type system for the synchronous polyadic calculus, allowing us to mechanize the analysis of input/output capabilities of mobile processes. The parameter of the generic type system is a latticeordered monoid, the elements of which are used to describe the capabilities of chan ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
We introduce a generic type system for the synchronous polyadic calculus, allowing us to mechanize the analysis of input/output capabilities of mobile processes. The parameter of the generic type system is a latticeordered monoid, the elements of which are used to describe the capabilities of channels with respect to their input/output cabilities. The type system can be instantiated in order to check process properties such as upper and lower bounds on the number of active channels, confluence and absence of blocked processes.
Hypergraph Construction and Its Application to the Compositional Modelling of Concurrency
 IN GRATRA 2000: JOINT APPLIGRAPH/GETGRATS WORKSHOP ON GRAPH TRANSFORMATION SYSTEMS
, 2000
"... We define a construction operation on hypergraphs using a colimit and show that its expressiveness concerning graph rewriting is equal to the graph expressions of Courcelle and the doublepushout approach of Ehrig. With an inductive way of representing graphs, graph rewriting arises naturally as a ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We define a construction operation on hypergraphs using a colimit and show that its expressiveness concerning graph rewriting is equal to the graph expressions of Courcelle and the doublepushout approach of Ehrig. With an inductive way of representing graphs, graph rewriting arises naturally as a derived concept. The usefulness of our approach for the compositional modelling of concurrent systems is then shown by defining the semantics of a process calculus with mobility and of petri nets.