Algebra of Parameterised Graphs
- đ¤ Speaker: Andrey Mokhov, Newcastle University
- đ Date & Time: Friday 23 May 2014, 11:00 - 12:00
- đ Venue: Small Lecture Theatre, Microsoft Research Ltd, 21 Station Road, Cambridge, CB1 2FB
Abstract
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.
Series This talk is part of the Microsoft Research Cambridge, public talks series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- Cambridge Centre for Data-Driven Discovery (C2D3)
- Cambridge talks
- Chris Davis' list
- Guy Emerson's list
- Interested Talks
- Microsoft Research Cambridge, public talks
- ndk22's list
- ob366-ai4er
- Optics for the Cloud
- personal list
- PMRFPS's
- rp587
- School of Technology
- Small Lecture Theatre, Microsoft Research Ltd, 21 Station Road, Cambridge, CB1 2FB
- Trust & Technology Initiative - interesting events
- yk449
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)

Andrey Mokhov, Newcastle University
Friday 23 May 2014, 11:00-12:00