Abstract
The paper addresses a notion of configuring systems, constructing them from specified component parts with specified sharing. This notion is independent of any underlying specification language and has been abstractly identified with the taking of colimits in category theory. Mathematically it is known that these can be expressed by presheaves and the present paper applies this idea to configuration. We interpret the category theory informally as follows. Suppose script c sign is a category whose objects are interpreted as specifications, and for which each morphism u : X → Y is interpreted as contravariant 'instance reduction', reducing instances of specification Y to instances of X. Then a presheaf P: Set script c signop represents a collection of instances that is closed under reduction. We develop an algebraic account of presheaves in which we present configurations by generators (for components) and relations (for shared reducts), and we outline a proposed configuration language based on the techniques. Oriat uses diagrams to express colimits of specifications, and we show that Oriat's category Diag(script c sign) of finite diagrams is equivalent to the category of finitely presented presheaves over script c sign.
Author supplied keywords
Cite
CITATION STYLE
Vickers, S., & Hill, G. (2001). Presheaves as configured specifications. Formal Aspects of Computing, 13(1), 32–49. https://doi.org/10.1007/PL00003938
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.