A Superposition Operator for the Refinement of Algebraic Models
โ Scribed by Claus Pahl
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 183 KB
- Volume
- 40
- Category
- Article
- ISSN
- 1571-0661
No coin nor oath required. For personal study only.
โฆ Synopsis
The development of computer languages or software artefacts from basic concepts to the final product is usually a process starting with an abstract model of a key concept and extending this by adding more detailed functionality for extended structural definitions. We will present a refinement approach for the stepwise development of algebraic models. In each step we either add new elements to a model or refine the properties of existing ones. The process of refining elements such that properties of the original element are preserved is called superposition. We will present a categorical framework for refining algebraic structures. Algebras can be used to model a variety of concepts and objects. Language semantics and formal methods are two application areas which use models represented in terms of algebras.
๐ SIMILAR VOLUMES
In a model proposed for cell pattern formation by Nagorcka et al. (J. Theor. Biol. 1987) linear analysis revealed the possibility of an initially spatially uniform cell density going unstable to perturbations of two distinct spatial modes. Here we examine a simple one-dimensional caricature of their
Given a ยฎnitely supported sequence a on Z s and an s ร s dilation matrix M, the transition operator is the linear operator deยฎned by va X bPZ s wa ร bvb, where a P Z s and v lies in 0 Z s , the linear space of all ยฎnitely supported sequences on Z s . In this paper we investigate the spectral propert