Results 1 
6 of
6
Autonomous units and their semantics  the sequential case
 ICGT 2006. LNCS
, 2006
"... In this paper, we introduce the notion of a community of autonomous units as a rulebased and graphtransformational device to model processes that run interactively but independently of each other in a common environment. The emphasis of the approach is laid on the study of the formal semantics of ..."
Abstract

Cited by 6 (6 self)
 Add to MetaCart
(Show Context)
In this paper, we introduce the notion of a community of autonomous units as a rulebased and graphtransformational device to model processes that run interactively but independently of each other in a common environment. The emphasis of the approach is laid on the study of the formal semantics of a community as a whole and of each of its member units separately. We concentrate on the sequential case where only one unit can act at a time and the rule applications of the involved units are interleaved with each other.
Some essentials of graph transformation
 RECENT ADVANCES IN FORMAL LANGUAGES AND APPLICATIONS. STUDIES IN COMPUTATIONAL INTELLIGENCE
, 2006
"... This chapter introduces rulebased graph transformation, which constitutes a wellstudied research area in computer science. The chapter presents the most fundamental definitions and illustrates them with some selected examples. It presents also the concept of transformation units, which makes pure ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
This chapter introduces rulebased graph transformation, which constitutes a wellstudied research area in computer science. The chapter presents the most fundamental definitions and illustrates them with some selected examples. It presents also the concept of transformation units, which makes pure graph transformation more feasible for specification and modeling aspects. Moreover, a translation of Chomsky grammars into graph grammars is given and the main theorems concerning parallelism and concurrency are presented. Finally, an introduction to hyperedge replacement is given, a concept which has nice properties because it transforms hypergraphs in a contextfree way.
Semantics of Visual Models in a Rulebased Setting
, 2006
"... In this paper, some fundamental aspects of the semantics of rulebased systems are sketched and related to the semantics of visual models. A rulebased system comprises a set of rules and some control conditions including descriptions of initial and terminal configurations. Semantically, the rules s ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In this paper, some fundamental aspects of the semantics of rulebased systems are sketched and related to the semantics of visual models. A rulebased system comprises a set of rules and some control conditions including descriptions of initial and terminal configurations. Semantically, the rules specify a binary relation on configurations of some kind by means of rule applications which are restricted according to the control conditions. As visual models are usually represented by diagrams, graphs or similar configurations, the rulebased setting can be employed to provide visual models with semantics.
Main Concepts of Networks of Transformation Units with Interlinking Semantics
, 2005
"... The aim of this paper is to introduce a modelling concept and structuring principle for rulebased systems the semantics of which is not restricted to a sequential behavior, but can be applied to various types of parallelism and concurrency. The central syntactic notion is that of a transformation ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
The aim of this paper is to introduce a modelling concept and structuring principle for rulebased systems the semantics of which is not restricted to a sequential behavior, but can be applied to various types of parallelism and concurrency. The central syntactic notion is that of a transformation unit that encapsulates a set of rules, imports other transformation units, and regulates the use and interaction of both by means of a control condition. The semantics is given by interlinking the applications of rules with the semantics of the imported units using a given collection of semantic operations. As the main result, the interlinking semantics turns out to be the least fixed point of the interlinking operator. The interlinking semantics generalizes the earlier introduced interleaving semantics of rulebased transformation units, which is obtained by the sequential composition of binary relations as only semantic operation.
To be used only in the SegraVis School 2006! Autonomous Units and their Semantics — the Sequential Case ⋆
"... Abstract. In this paper, we introduce the notion of a community of autonomous units as a rulebased and graphtransformational device to model processes that run interactively but independently of each other in a common environment. The emphasis of the approach is laid on the study of the formal sem ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. In this paper, we introduce the notion of a community of autonomous units as a rulebased and graphtransformational device to model processes that run interactively but independently of each other in a common environment. The emphasis of the approach is laid on the study of the formal semantics of a community as a whole and of each of its member units separately. We concentrate on the sequential case where only one unit can act at a time and the rule applications of the involved units are interleaved with each other. 1