NETS AND GRAPHS AS PINAL COMPLETIONS AND THE RELATIONS BETWEEN THEM

Abstract

Nets and graphs, both used in Computer Science, are studied from a categorical point of view. It is shown that they may be constructed via final completions of very simple small concrete categories and that their nice properties, namely to form topological categories which are quasitopoi with concrete powers such that products of final maps are final, depend on this fact. Furthermore, the relations between them can be described by means of adjoint functors.