BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Open maps and their uses in concurrency models - Tamas Kispeter (U
 niversity of Cambridge)
DTSTART:20160212T110000Z
DTEND:20160212T120000Z
UID:TALK63833@talks.cam.ac.uk
CONTACT:Ian Orton
DESCRIPTION:Open maps and path lifting appears in a number of fields and i
 n a number of guises. I am going to use the example of event structures to
  explore what open maps can do\, whether that's bisimulations or symmetry.
  \n\nCovering:\n\n   * What is an open map and path lifting\n   * Event st
 ructures and what open maps look like\n   * Bisimulation from open maps\n 
   * Some symmetry stuff\n\nPrerequisites:\n\n   * Basic category theory: s
 pans\, pullbacks\, presheaves\n   * Some basic concurrency models: event s
 tructures\, synchronisation trees\, labelled transition systems (the first
  two papers will have quick synopsis for all)
LOCATION:Rainbow Room (FS07)\, Computer Laboratory
END:VEVENT
END:VCALENDAR