University of Cambridge > > Logic & Semantics for Dummies > Open maps and their uses in concurrency models

Open maps and their uses in concurrency models

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Ian Orton.

Open maps and path lifting appears in a number of fields and in 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.


  • What is an open map and path lifting
  • Event structures and what open maps look like
  • Bisimulation from open maps
  • Some symmetry stuff


  • Basic category theory: spans, pullbacks, presheaves
  • Some basic concurrency models: event structures, synchronisation trees, labelled transition systems (the first two papers will have quick synopsis for all)

This talk is part of the Logic & Semantics for Dummies series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity