𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algebra Transformation Systems as a Unifying Framework

✍ Scribed by Martin Große–Rhode


Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
286 KB
Volume
51
Category
Article
ISSN
1571-0661

No coin nor oath required. For personal study only.

✦ Synopsis


There is a variety of different approaches to the specification of software systems based on graph rewriting. In order to relate these and other state and/or rules based approaches algebra transformation systems have been introduced. They constitute a semantic domain that is independent of the way in which the rewriting of graphs or algebras is defined (implemented). Composition operations and refinement relations have been defined for algebra transformation systems that yield a comprehensive semantic specification framework in this way. Corresponding notions of rewriting, transformation system, composition and refinement in the different graph rewriting approaches can be compared with these semantic notions to relate them and exhibit their compatibility.


📜 SIMILAR VOLUMES


GRACE as a unifying approach to graph-tr
✍ Hans-Jörg Kreowski; Giorgio Busatto; Sabine Kuske 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 203 KB

In this paper, we sketch some basic ideas and features of the graph-transformationbased specification language GRACE. The aim of GRACE is to support the modeling of a wide spectrum of graph and graphical processes in a structured and uniform way including visualization and verification. • approach

Grey box modelling for control: Qualitat
✍ S. Bay Jørgensen; Katalin M. Hangos 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 978 KB

## Abstract Grey box modelling traditionally reflects that both __a priori__ and experimental knowledge are being incorporated into the model‐building process, where both of them may exhibit uncertain character. A brief investigation into various grey box modelling approaches reveals that they diff

Collage system: a unifying framework for
✍ Takuya Kida; Tetsuya Matsumoto; Yusuke Shibata; Masayuki Takeda; Ayumi Shinohara 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 234 KB

We introduce a general framework which is suitable to capture the essence of compressed pattern matching according to various dictionary-based compressions. It is a formal system to represent a string by a pair of dictionary D and sequence S of phrases in D. The basic operations are concatenation, t