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 i
β¦ LIBER β¦
Components for Algebra Transformation Systems
β Scribed by Fernando Orejas; Hartmut Ehrig
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 723 KB
- Volume
- 82
- Category
- Article
- ISSN
- 1571-0661
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Algebra Transformation Systems as a Unif
β
Martin GroΓeβRhode
π
Article
π
2002
π
Elsevier Science
π
English
β 286 KB
Usability levels for sparse linear algeb
β
M. Sosonkina; F. Liu; R. Bramley
π
Article
π
2008
π
John Wiley and Sons
π
English
β 368 KB
π 1 views
Program Algebra for Component Code
β
J. A. Bergstra; M. E. Loots
π
Article
π
2000
π
Springer
π
English
β 135 KB
A transform method for solving certain s
β
Ronald Guenther
π
Article
π
1971
π
Springer Vienna
π
English
β 220 KB
Transformation Systems for Incidence Str
β
G. Rinaldi; L.A. Rosati
π
Article
π
1999
π
Elsevier Science
π
English
β 83 KB
By taking into account the transformation technique of Quattrocchi and Rosati, we study how to generate transformation systems for an incidence structure by starting from some given generating blocks and by a suitable permutation of the points. Furthermore, the method is applied to obtain the finite
Backlund transformation for integrable s
β
A. N. Leznov
π
Article
π
1992
π
Springer US
π
English
β 309 KB