Wyniki wyszukiwania - BazTech

1

A Generic Approach to Connector Architectures. Part II: Instantiation to Petri Nets and CSP

Orejas F., Klein M., Pino E., Ehrig H., Padberg J., Pérez S.

Fundamenta Informaticae

|

2010

|

Vol. 99, nr 1

95-124

EN

The aim of this paper is to show how the generic approach to connector architectures, presented in the first part of this work, can be applied to a given modeling formalism to define architectural component and connector notions associated to that formalism. Starting with a review of the generic approach, in this second part of the paper we consider two modeling formalisms: elementary Petri nets and CSP. As main results we show that both cases satisfy the axioms of our component framework, so that the results concerning the semantics of architectures can be applied. Moreover, a small case study in terms of Petri Nets is presented in order to show how the results can be applied to a connector architecture based on Petri nets.

2

A Generic Approach to Connector Architectures. Part I: The General Framework

Orejas F., Klein M., Pino E., Ehrig H., Padberg J., Pérez S.

Fundamenta Informaticae

|

2010

|

Vol. 99, nr 1

63-93

EN

The aim of this paper is to present a generic framework for the modelling of componentbased systems using architectural connectors. More precisely, concepts of component, connector and architecture are presented in a formal generic way, which are independent of any semi-formal or formal modelling approach. The idea is that one could use this framework to define component and connector notions for every given modelling formalism. As a main result, we define the semantics of architectures using graph transformation, showing that the semantics is independent of the order in which the connections are computed, and that the semantics is compatible with transformation. In the continuation of this paper, we show the applicability of our ideas. In particular, our framework is instantiated by Petri nets and CSP, including a case study using Petri Nets.

3

Adhesive High-Level Replacement Systems: A New Categorical Framework for Graph Transformation

Ehrig H., Padberg J., Prange U.

Fundamenta Informaticae

|

2006

|

Vol. 74, nr 1

1-29

EN

Adhesive high-level replacement (HLR) systems are introduced as a new categorical framework for graph transformation in the double pushout (DPO) approach, which combines the well-known concept of HLR systems with the new concept of adhesive categories introduced by Lack and Sobociński. In this paper we show that most of the HLR properties, which had been introduced to generalize some basic results from the category of graphs to high-level structures, are valid already in adhesive HLR categories. This leads to a smooth categorical theory of HLR systems which can be applied to a large variety of graphs and other visual models. As a main new result in a categorical framework we show the Critical Pair Lemma for the local confluence of transformations. Moreover we present a new version of embeddings and extensions for transformations in our framework of adhesive HLR systems.