Algebra of Parameterised Graphs

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

• Andrey Mokhov, Newcastle University
• Friday 23 May 2014, 11:00-12:00
• Small Lecture Theatre, Microsoft Research Ltd, 21 Station Road, Cambridge, CB1 2FB.

If you have a question about this talk, please contact Microsoft Research Cambridge Talks Admins.

This event may be recorded and made available internally or externally via http://research.microsoft.com. Microsoft will own the copyright of any recordings made. If you do not wish to have your image/voice recorded please consider this before attending

What happens if you spill a bucket of predicates over a graph? You get what I call a parameterised graph—a mathematical beauty with interesting properties and applications. In this talk I will define parameterised graphs algebraically and will show you how to use them for succinct specification, verification and synthesis of concurrent systems, with examples coming from hardware and software engineering. I will conclude by highlighting several questions about parameterised graphs that I don’t have an answer for, hopefully getting fresh insights from the audience.

This talk is part of the Microsoft Research Cambridge, public talks series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Cambridge Centre for Data-Driven Discovery (C2D3)
• Cambridge talks
• Chris Davis' list
• Guy Emerson's list
• Interested Talks
• Microsoft Research Cambridge, public talks
• Optics for the Cloud
• PMRFPS's
• School of Technology
• Small Lecture Theatre, Microsoft Research Ltd, 21 Station Road, Cambridge, CB1 2FB
• Trust & Technology Initiative - interesting events
• bld31
• ndk22's list
• ob366-ai4er
• personal list
• rp587

Note that ex-directory lists are not shown.