On the complexity of specification morphisms
β Scribed by Serafino Cicerone; Francesco Parisi-Presicce
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 695 KB
- Volume
- 189
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
β¦ Synopsis
The existence and the construction of a specification morphism between two algebraic specifications is a crucial step in modular system design and in the reusability of software. The problem of determining the existence of a signature morphism between two algebraic signatures is analyzed and proved to be NP-complete by reducing the well known 3SAT problem. As a consequence, the problem of finding a specification morphism is at least as hard as that of verifying its existence.
π SIMILAR VOLUMES
A scene animation involving a limited environmental boundary, obstacles, other static and dynamic objects, and scene events is more interdependent, variable, and personal than a single object's animation. Traditional path specification does not directly address the special issues in this problem dom