Open maps and their uses in concurrency models

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

• Tamas Kispeter (University of Cambridge)
• Friday 12 February 2016, 11:00-12:00
• Rainbow Room (FS07), Computer Laboratory.

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.

Covering:

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

Prerequisites:

• 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.

This talk is included in these lists:

• Logic & Semantics for Dummies
• Rainbow Room (FS07), Computer Laboratory
• tcw57’s list
• yk373's list

Note that ex-directory lists are not shown.