Abstract
We formalise, using Category Theory, modularisation techniques for parallel and distributed systems based on the notion of superposition, showing that parallel program design obeys the "universal laws" formulated by Goguen for General Systems Theory, as well as other algebraic properties of modularity formulated for Specification Theory. The resulting categorical formalisation unifies the different notions of superposition that have been proposed in the literature and clarifies their algebraic properties with respect to modularisation. It also suggests ways of extending or revising existing languages in order to provide higher levels of reusability, modularity and incrementality in system design. © 1997 Elsevier Science B.V.
| Original language | English |
|---|---|
| Pages (from-to) | 111-138 |
| Number of pages | 28 |
| Journal | Science of Computer Programming |
| Volume | 28 |
| Issue number | 2-3 |
| DOIs | |
| Publication status | Published - Apr 1997 |
Keywords
- Component interconnection
- Incremental design
- Modularity
- Program morphisms
- Reactive systems
- Superposition
- System configuration
- Universal constructions