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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Open maps and their uses in concurrency models

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.

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:

Note that ex-directory lists are not shown.

Other lists

Goldsmiths 2 & https://zoom.us/j/96836714124 South Room, West Hub OCR, Progress House, Westwood Way, Coventry, UK

Other talks

Title to be confirmed Cultural evolution creates language-like structure: from humans to humpback whales and beyond Washing machines and their rare components: lessons from kidney patients Group Work Grand Rounds - Equine Royal Papworth Hospital and Acute Medicine
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity