Toposes Are Adhesive
Adhesive categories have recently been proposed as a categorical foundation for facets of the theory of graph transformation, and have also been used to study techniques from process algebra for reasoning about concurrency. Here we continue our study of adhesive categories by showing that toposes are adhesive. The proof relies on exploiting the relationship between adhesive categories, Brown and Janelidze’s work on generalised van Kampen theorems as well as Grothendieck’s theory of descent.
KeywordsGraph Transformation Process Algebra Comparison Functor Extensive Category Pullback Diagram
Unable to display preview. Download preview PDF.
- 5.Ehrig, H., Habel, A., Kreowski, H.-J., Parisi-Presicce, F.: Parallelism and concurrency in high-level replacement systems. Mathematical Structures in Computer Science 1 (1991)Google Scholar
- 8.Fiore, M., Staton, S.: Comparing operational models of name-passing process calculi. Information and Computation (to appear, 2005)Google Scholar
- 10.Johnstone, P.T.: Sketches of an Elephant: A topos theory compendium, vol. 1. Clarendon Press, Oxford (2002)Google Scholar
- 13.Sassone, V., Sobociński, P.: Reactive systems over cospans. In: Logic in Computer Science, LiCS 2005, pp. 311–320. IEEE Press, Los Alamitos (2005)Google Scholar