BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Bisimulation and Model-Checking for Partial Order Models of Concur
 rency - Julian Gutierrez\, University of Edinburgh
DTSTART:20110311T140000Z
DTEND:20110311T150000Z
UID:TALK30153@talks.cam.ac.uk
CONTACT:Bjarki Holm
DESCRIPTION:In this talk I will present some results on logics and games u
 sed to study the bisimulation and model-checking problems for various part
 ial order models of concurrency\, which include Petri nets and event struc
 tures. In particular I will present: a number of mu-calculi (in this case\
 , fixpoint extensions of modal logic) that\, in certain classes of systems
 \, induce the same identifications as some of the standard bisimulation eq
 uivalences for concurrency\; secondly\, a family of (infinite) higher-orde
 r logic games for verification where the players of the games are given (l
 ocal) monadic second-order power on the sets of elements they are allowed 
 to play. And\, finally\, a new order-theoretic concurrent game model where
  bisimulation and model-checking can be studied in a uniform way. 
LOCATION:Room FW11\, Computer Laboratory\, William Gates Building
END:VEVENT
END:VCALENDAR
