Results 1  10
of
29
A Graph Based Architectural (Re)configuration Language
 In Proc. of the Joint European Software Engineering Conference and Symp. On the Foundations of Software Engineering
, 2001
"... For several different reasons, such as changes in the business or technological environment, the configuration of a system may need to evolve during execution. Support for such evolution can be conceived in terms of a language for specifying the dynamic reconfiguration of systems. In this paper, con ..."
Abstract

Cited by 43 (4 self)
 Add to MetaCart
For several different reasons, such as changes in the business or technological environment, the configuration of a system may need to evolve during execution. Support for such evolution can be conceived in terms of a language for specifying the dynamic reconfiguration of systems. In this paper, continuing our work on the development of a formal platform for architectural design, we present a highlevel language to describe architectures and for operating changes over a configuration (i.e., an architecture instance), such as adding, removing or substituting components or interconnections. The language follows an imperative style and builds on a semantic domain established in previous work. Therein, we model architectures through categorical diagrams and dynamic reconfiguration through algebraic graph rewriting. 1.
Synchronised Hyperedge Replacement as a Model For Service Oriented Computing
, 2006
"... ..."
(Show Context)
NonFunctional Aspects of Wide Area Network Programming
, 2003
"... WideArea Network (WAN) applications have become one of the most popular applications in current distributed computing. Internet and the World Wide Web are now the primary environment for designing, developing and distributing applications. This scenario imposes different programming metaphors wit ..."
Abstract

Cited by 13 (13 self)
 Add to MetaCart
(Show Context)
WideArea Network (WAN) applications have become one of the most popular applications in current distributed computing. Internet and the World Wide Web are now the primary environment for designing, developing and distributing applications. This scenario imposes different programming metaphors with respect to traditional applications. Theoretical models for formally reasoning on WAN applications must consider many crucial aspects and their mutual relationships, e.g. mobility, network awareness, security, service level agreement, etc. This dissertation attempts to formally define declarative approaches for dealing with various facets of actual WAN programming and verification issues. We propose a declarative approach based on hypergraphs that provide foundational framework for “declaring ” components ’ behaviours of a distributed system. It is exercised with two wellknown models for distributed computations as Ambient and Klaim. Moreover, we extend Klaim with constructs for specifying, at applica
Synchronized hyperedge replacement for heterogeneous systems
 IN PROC. OF COORDINATION’05, VOLUME 3454 OF LNCS
, 2005
"... We present a framework for modelling heterogeneous distributed systems using graph transformations in the Synchronized Hyperedge Replacement approach, which describes complex evolutions by synchronizing local rules. In order to deal with heterogeneity, we consider different synchronization algebras ..."
Abstract

Cited by 12 (7 self)
 Add to MetaCart
(Show Context)
We present a framework for modelling heterogeneous distributed systems using graph transformations in the Synchronized Hyperedge Replacement approach, which describes complex evolutions by synchronizing local rules. In order to deal with heterogeneity, we consider different synchronization algebras for different communication channels. The main technical point is the interaction between synchronization algebras and name mobility in the πcalculus style. The power of our approach is shown through a few examples.
Synchronization algebras with mobility for graph transformations
"... We propose a generalization of synchronization algebras that allows to deal with mobility and local resource handling. We show how it can be used to model communication primitives for distributed and mobile computations, such as the ones used in the global computing area. We propose a graph transf ..."
Abstract

Cited by 11 (8 self)
 Add to MetaCart
(Show Context)
We propose a generalization of synchronization algebras that allows to deal with mobility and local resource handling. We show how it can be used to model communication primitives for distributed and mobile computations, such as the ones used in the global computing area. We propose a graph transformation formalism in the Synchronized Hyperedge Replacement approach which is parametric w.r.t. the synchronization algebra and thus allows to model complex systems based on the chosen communication primitives. We thus unify different models described in the literature and we allow to easily define new ones. We present various examples and a case study on Fusion Calculus, showing how different semantics for it can be derived using different synchronization algebras.
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 (7 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.
Mapping Fusion and Synchronized Hyperedge Replacement into Logic Programming
 UNDER CONSIDERATION FOR PUBLICATION IN THEORY AND PRACTICE OF LOGIC PROGRAMMING
"... In this paper we compare three different formalisms that can be used in the area of models for distributed, concurrent and mobile systems. In particular we analyze the relationships between a process calculus, the Fusion Calculus, graph transformations in the Synchronized Hyperedge Replacement with ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
(Show Context)
In this paper we compare three different formalisms that can be used in the area of models for distributed, concurrent and mobile systems. In particular we analyze the relationships between a process calculus, the Fusion Calculus, graph transformations in the Synchronized Hyperedge Replacement with Hoare synchronization (HSHR) approach and logic programming. We present a translation from Fusion Calculus into HSHR (whereas Fusion Calculus uses Milner synchronization) and prove a correspondence between the reduction semantics of Fusion Calculus and HSHR transitions. We also present a mapping from HSHR into a synchronized version of logic programming and prove that there is a full correspondence between the two formalisms. The resulting mapping from Fusion Calculus to logic programming is interesting since it shows the tight analogies between the two formalisms, in particular for handling name generation and mobility. The intermediate step in terms of HSHR is convenient since graph transformations allow for multiple, remote synchronizations, as required by Fusion Calculus semantics.
Modelling Dynamic Software Architectures using Typed Graph Grammars
, 2007
"... Several recent research efforts have focused on the dynamic aspects of software architectures providing suitable models and techniques for handling the runtime modification of the structure of a system. A large number of heterogeneous proposals for addressing dynamic architectures at many different ..."
Abstract

Cited by 6 (6 self)
 Add to MetaCart
(Show Context)
Several recent research efforts have focused on the dynamic aspects of software architectures providing suitable models and techniques for handling the runtime modification of the structure of a system. A large number of heterogeneous proposals for addressing dynamic architectures at many different levels of abstraction have been provided, such as programmable, adhoc, selfhealing and selfrepairing among others. It is then important to have a clear picture of the relations among these proposals by formulating them into a uniform framework. Our work is a contribution in this line. In particular, we map several notions of dynamicity into the same formal framework (i.e. typed graph grammar) in order to distill the similarities and differences among them. As a result we provide a characterization of different styles of architectural dynamisms in term of graph grammars with the purpose to understand the kinds of properties that can be naturally associated to such different specification styles and we describe them over a simple case study.
Tarzan: Communicating and Moving in Wireless Jungles
 QAPL 2004 PRELIMINARY VERSION
, 2004
"... Wireless networks allow portable/mobile devices (and the related applications) to communicate each other with radio or infrared signals. Computations on those networks are very sensible to many physical variables (e.g., energy consumption, distance, geographic topology, etc.). We propose Tarzan, a f ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
Wireless networks allow portable/mobile devices (and the related applications) to communicate each other with radio or infrared signals. Computations on those networks are very sensible to many physical variables (e.g., energy consumption, distance, geographic topology, etc.). We propose Tarzan, a framework based on graph rewriting that easily allow one to express many quantitative aspects of wireless networks. Apart from the expressiveness issue, the main advantage of Tarzan is its formal semantics that can be exploited for specifying applications, routing algorithms or coordination aspects of wireless devices considering realistic physical limitations.