Abstract- In this paper we introduce a general, extensible diagrammatic syntax for expressing software architecturesbased on typed nodes and connections and formalized using set theory. The syntax provides a notion of abstractioncorresponding to the conceptofasubsystem,andexploitsthisnotioninageneralmech- anism for pattern matching over architectures.We demonstrate these ideas using a small example architecture language with a limited number of types of nodes and connectors, and a small taxonomy of architecturescharacterizedas sets of patterns in the language.
Read in full here:
This thread was posted by one of our members via one of our news source trackers.