|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
From Communicating Machines to Graphical Choreographies
If you have a question about this talk, please contact Jonathan Hayman.
Graphical choreographies, or global graphs, are general multiparty session specifications featuring expressive constructs such as forking, merging, and joining for representing application-level protocols. Global graphs can be directly translated into modelling notations such as BPMN and UML . In this talk, I will present (i) an algorithm whereby a global graph can be constructed from asynchronous interactions represented by communicating finite-state machines (CFSMs); and (ii) a sound and complete characterisation of a subset of safe CFS Ms from which global graphs can be constructed.
This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
Other listsEngineering Department Outreach Talks Cambridge American History Seminar Early Modern British and Irish History Seminar
Other talksJeff Tabor (Rice University)- Title to be confirmed Does entrained tACS modulate speech-specific BOLD responses? Evidence from combined tACS-fMRI Vibrational coherence spectroscopy applied to biomimetic molecular photoswitches Squashed sigma-models and mock modular forms Postgraduate Diploma in Entrepreneurship webinar Thinking religion today with Gandhi