Results 1 - 10
of
52
Software Architecture Styles as Graph Grammars
- In Proceedings of the Fourth ACM SIGSOFT Symposium on the Foundations of Software Engineering
, 1996
"... We present a formalism for the definition of software architectures in terms of graphs. Nodes represent the individual agents and edges define their interconnection. Individual agents can communicate only along the links specified by the architecture. The dynamic evolution of the overall architectur ..."
Abstract
-
Cited by 47 (6 self)
- Add to MetaCart
(Show Context)
We present a formalism for the definition of software architectures in terms of graphs. Nodes represent the individual agents and edges define their interconnection. Individual agents can communicate only along the links specified by the architecture. The dynamic evolution of the overall architecture is defined independently by a `coordinator'. An architecture style is a class of architectures characterised by a graph grammar. The rules of the coordinator are statically checked to ensure that they preserve the constraints imposed by the architecture style. Keywords: coordination, graph rewriting, software architecture, static verification. 1 Motivation and approach Software systems tend to grow in size and complexity; they are often developed through a long period of time and become extremely difficult to understand and to maintain. The cost incurred by this complexity is becoming a serious concern and a major challenge today is to provide ways of organising software in order to make...
Graph grammars and constraint solving for software architecture styles
- IN PROC. OF THE INT. SOFTWARE ARCHITECTURE WORKSHOP
, 1998
"... The description of a software architecture style must include the structural model of the components and their interactions, the laws governing the dynamic changes in the architecture, and the communication pattern. In our work we represent a system as a graph where hyperedges are components and nod ..."
Abstract
-
Cited by 34 (4 self)
- Add to MetaCart
(Show Context)
The description of a software architecture style must include the structural model of the components and their interactions, the laws governing the dynamic changes in the architecture, and the communication pattern. In our work we represent a system as a graph where hyperedges are components and nodes are ports of communication. The construction and dynamic evolution of the style will be represented as context-free productions and graph rewriting. To model the evolution of the system we propose to use techniques of constraint solving. From this approach we obtain an intuitive way to model systems with nice characteristics for the description of dynamic architectures and recon guration and, a unique language to describe the style, model the evolution of the system and prove properties.
Graph Rewriting and Constraint Solving for Modelling Distributed Systems with Synchronization (Extended Abstract)
- Proceedings of the First International Conference COORDINATION ’96
, 1996
"... ) Ugo Montanari and Francesca Rossi Universit`a di Pisa, Dipartimento di Informatica Corso Italia 40, 56125 Pisa, Italy E-mail: fugo,rossig@di.unipi.it Abstract. In this extended abstract we describe our approach to modelling the dynamics of distributed systems. For distributed systems we mean sys ..."
Abstract
-
Cited by 24 (5 self)
- Add to MetaCart
(Show Context)
) Ugo Montanari and Francesca Rossi Universit`a di Pisa, Dipartimento di Informatica Corso Italia 40, 56125 Pisa, Italy E-mail: fugo,rossig@di.unipi.it Abstract. In this extended abstract we describe our approach to modelling the dynamics of distributed systems. For distributed systems we mean systems consisting of concurrent processes communicating via shared ports and posing certain synchronization requirements, via the ports, to the adjacent processes. We use graphs to represent states of such systems, and graph rewriting to represent their evolution. The kind of graph rewriting we use is based on simple context-free productions which are however combined by means of the synchronization mechanism. This allows for a good level of expressivity in the system without sacrifying full distribution. Moreover, to approach the problem of combining productions together, we suggest to exploit existing techniques for constraint solving. This is based on the observation that the combination pr...
Synchronised Hyperedge Replacement as a Model For Service Oriented Computing
, 2006
"... ..."
(Show Context)
Graph Rewriting, Constraint Solving and Tiles for Coordinating Distributed Systems
- Applied Categorical Structures
, 1999
"... . In this paper we describe an approach to model the dynamics of distributed systems. For distributed systems we mean systems consisting of concurrent processes communicating via shared ports and posing certain synchronization requirements, via the ports, to the adjacent processes. The basic idea is ..."
Abstract
-
Cited by 19 (15 self)
- Add to MetaCart
(Show Context)
. In this paper we describe an approach to model the dynamics of distributed systems. For distributed systems we mean systems consisting of concurrent processes communicating via shared ports and posing certain synchronization requirements, via the ports, to the adjacent processes. The basic idea is to use graphs to represent states of such systems, and graph rewriting to represent their evolution. The kind of graph rewriting we use is based on simple context-free productions which are however combined by means of a synchronization mechanism. This allows for a good level of expressivity in the system without sacrifying full distribution. To formally model this kind of graph rewriting, however, we do not adopt the classical graph rewriting style but a more general framework, called the tile model, which allows for a clear separation between sequential rewriting and synchronization. Then, since the problem of satisfying the synchronization requirements may be a complex combinatorial pro...
Distributed Graph Transformation With Application To Visual Design Of Distributed Systems
- Handbook of Graph Grammars and Computing by Graph Transformation, Volume 3: Concurrency, Parallelism, and Distribution
"... this article, new concepts for visual ..."
(Show Context)
On Relating Rewriting Systems and Graph Grammars to Event Structures
- GRAPH TRANSFORMATIONS IN COMPUTER SCIENCE. LECTURE NOTES IN COMPUTER SCIENCE 776
, 1994
"... In this paper, we investigate how rewriting systems and especially graph grammars as operational models of parallel and distributed systems can be related to event structures as more abstract models. First, distributed rewriting systems that are based on the notion of contexts are introduced as a ..."
Abstract
-
Cited by 13 (0 self)
- Add to MetaCart
In this paper, we investigate how rewriting systems and especially graph grammars as operational models of parallel and distributed systems can be related to event structures as more abstract models. First, distributed rewriting systems that are based on the notion of contexts are introduced as a common framework for different kinds of rewriting systems and their parallelism properties are investigated. Then we introduce concrete graph grammars and show how they can be integrated into this framework for rewriting systems. A construction for the Mazurkiewicz trace language related to the derivation sequences of a distributed rewriting system is presented. Since there is a well-known relation between trace languages and event structures, this provides the link between (graph) rewriting and event structures.
Non-Functional Aspects of Wide Area Network Programming
, 2003
"... Wide-Area Network (WAN) applications have become one of the most popular ap-plications in current distributed computing. Internet and the World Wide Web are now the primary environment for designing, developing and distributing appli-cations. This scenario imposes different programming metaphors wit ..."
Abstract
-
Cited by 13 (13 self)
- Add to MetaCart
(Show Context)
Wide-Area Network (WAN) applications have become one of the most popular ap-plications in current distributed computing. Internet and the World Wide Web are now the primary environment for designing, developing and distributing appli-cations. 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 aware-ness, 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 founda-tional framework for “declaring ” components ’ behaviours of a distributed system. It is exercised with two well-known 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.
Hierarchically Distributed Graph Transformation
- Proc. 5th Int. Workshop on Graph Grammars and their Application to Computer Science
, 1994
"... . Hierarchically distributed graph transformation offers means to model different 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 ..."
Abstract
-
Cited by 12 (1 self)
- Add to MetaCart
(Show Context)
. Hierarchically distributed graph transformation offers means to model different 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 transformation. This new approach to graph transformation follows the lines of algebraic and categorical graph grammars and fits into the framework of doublepushout high-level replacement systems. Keywords: Graph transformation, distributed systems, communication, synchronization 1 Introduction Graphical representations are an obvious means to describe different aspects of systems. Modeling distributed and concurrent systems graphs are often used to describe the topological structure of the system. The graphical structure shows then which parts are involved and what are the ways of...
