Spans, trees and minimal realization

Bob Rosebrugh (10/2/99)

Recently Katis, Sabadini and Walters have proposed the (discrete, cartesian) bicategory of spans of directed graphs as a suitable algebra for concurrent computation. We propose trees as behaviours for a pointed version of the spans. After restricting to a suitable (non-full) subcategory reachable spans, we find a minimal realization.

This is joint work with N. Sabadini and R. Walters

Other talks by the same speaker.
Back to titles of seminars.

---

Steve Lack

Last modified: Tue May 22 09:49:10 EST 2001