Coalgebraic Modal Logic I

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

• Liang-Ting Chen
• Tuesday 15 May 2012, 12:00-13:00
• CS 217.

If you have a question about this talk, please contact Dan Ghica.

In this talk, I will briefly introduce Hennessy-Milner logic which is a modal logic expressive enough to characterise the bisimilarity of image-finite transition systems, and see how to generalise it to a logic for Set coalgebras using so-called predicate liftings. Under some boundedness conditions, it retains the expressivity property, i.e. the logical equivalence is equal to the behavioural equivalence. In the end, I will generalise the logic using predicate liftings further to a logic for general coalgebras and leave the expressivity property to the next talk.

This talk is part of the Lab Lunch series.

This talk is included in these lists:

• CS 217
• Computer Science Departmental Series
• Computer Science Distinguished Seminars
• Lab Lunch
• Theoretical computer science seminar
• computer sience

Note that ex-directory lists are not shown.