Wyniki wyszukiwania - BazTech

1

M-Adhesive Transformation Systems with Nested Application Conditions. Part 2: Embedding, Critical Pairs and Local Confluence

Ehrig H., Golas U., Habel A., Lambers L., Orejas F.

Fundamenta Informaticae

|

2012

|

Vol. 118, nr 1-2

35-63

EN

Graph transformation systems have been studied extensively and applied to several areas of computer science like formal language theory, the modeling of databases, concurrent or distributed systems, and visual, logical, and functional programming. In most kinds of applications it is necessary to have the possibility of restricting the applicability of rules. This is usually done by means of application conditions. In this paper, we continue the work of extending the fundamental theory of graph transformation to the case where rules may use arbitrary (nested) application conditions. More precisely, we generalize the Embedding theorem, and we study how local confluence can be checked in this context. In particular, we define a new notion of critical pair which allows us to formulate and prove a Local Confluence Theorem for the general case of rules with nested application conditions. All our results are presented, not for a specific class of graphs, but for any arbitraryM-adhesive category, which means that our results apply to most kinds of graphical structures. We demonstrate our theory on the modeling of an elevator control by a typed graph transformation system with positive and negative application conditions.

2

Ocena dobrostanu wilka (Canis lupus) w Ogrodzie Fauny Polskiej ZOO w Bydgoszczy

Habel A., Wójcik A.

Ekologia i Technika

|

2011

|

R. 19, nr 4

186-192

PL

W pracy dokonano oceny dobrostanu wilka europejskiego (Conis lupus) w Ogrodzie Fauny Polskiej ZOO w Bydgoszczy. W analizie uwzględniono takie parametry jak: warunki utrzymania, sposób żywienia i zachowanie się zwierząt. Porównano je z naturalnymi potrzebami tych ssaków, a także z wymogami zawartymi w uregulowaniach prawnych. Wilki w OFP mają zapewnione dobre warunki życia, pozwalające na utrzymanie stosunkowo wysokiego poziomu dobrostanu. Biorąc pod uwagę warunki utrzymania należy stwierdzić, że odpowiadają one wymogom dobrostanu, ale nie umożliwiają wykazywania wszystkich naturalnych zachowań, czego skutkiem mogą być zaobserwowane stereotypie motoryczne. Skład socjalny odpowiada naturalnej strukturze społecznej wilka. Zaleca się wprowadzenie dodatków roślinnych do diety wilka. Wskazane jest wzbogacenie środowiska życia wilka o elementy stymulacji psychicznej i ruchowej.

EN

The following paper presents the assessment of the well-being of the European Wolf (Canis lupus) in Ogród Fauny Polskiej ZOO in Bydgoszcz. The analysis includes such parameters as conditions of upkeep, ways of feeding and animals' behaviour. The data is compared to the natural needs of these mammals, as well as the requirements imposed by legal regulations. This data allowed to formulate a conclusion that the degree of wolves' well-being in OFP is relatively high. Taking into consideration the conditions of upkeep it appears the requirements of well-being are met, albeit they do not allow the animals to display all the natural behaviours, which may result in motor stereotyping observed in the wolves. The social composition observed reflects the natural structure among wolves. It is recommended that the introduction of vegetable ingredients in the diet and to enrich the living environment of wolves in the elements of mental and physical stimulation.

3

Theory of Constraints and Application Conditions: From Graphs to High-Level Structures

Ehrig H., Ehrig K., Habel A., Pennemann K-H.

Fundamenta Informaticae

|

2006

|

Vol. 74, nr 1

135-166

EN

Graph constraints and application conditions are most important for graph grammars and transformation systems in a large variety of application areas. Although different approaches have been presented in the literature already there is no adequate theory up to now which can be applied to different kinds of graphs and high-level structures. In this paper, we introduce a general notion of graph constraints and application conditions and show under what conditions the basic results can be extended from graph transformation to high-level replacement systems. In fact, we use the new framework of adhesive HLR categories recently introduced as combination of HLR systems and adhesive categories. Our main results are the transformation of graph constraints into right application conditions and the transformation from right to left application conditions in this new framework. The transformations are illustrated by a railroad control system with rail net constraints and application conditions.