Please note that this newsitem has been archived, and may contain outdated information or links.
11 November 2014, Logic Tea, Joshua Sack
Abstract
Graded modal logic is a modal logic that can distinguish among states in a Kripke model with different numbers of outgoing relational connections. One question that arrises is how to determine when two states are equivalent. Ordinary bisimilarity does not distinguish between states that are related to different numbers of equivalent states, however there are two definitions of bisimilarity that do: graded bisimilarity and resource bisimilarity. In this talk, we will compare these two definitions by using a coalgebraic semantics for graded modal logic that employs the finite multi-set functor and predicate liftings.
For more information, please visit the website http://www.illc.uva.nl/logic_tea/ or contact Thomas Brochhagen (t.s.brochhagen at uva.nl), Johannes Marti (johannes.marti at gmail.com), Masa Mocnik (masa.mocnik at gmail.com) or Julian Schloder (julian.schloeder at gmail.com).
Please note that this newsitem has been archived, and may contain outdated information or links.