BEGIN:VCALENDAR
VERSION:2.0
PRODID:ILLC Website
X-WR-TIMEZONE:Europe/Amsterdam
BEGIN:VTIMEZONE
TZID:Europe/Amsterdam
X-LIC-LOCATION:Europe/Amsterdam
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19700329T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19701025T030000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:/NewsandEvents/Archives/2009/newsitem/2721/9-F
 ebruary-2009-PROSE-Colloquium-Ana-Sokolova
DTSTAMP:20090205T000000
SUMMARY:PROSE Colloquium, Ana Sokolova
ATTENDEE;ROLE=Speaker:Ana Sokolova
DTSTART;TZID=Europe/Amsterdam:20090209T153000
DTEND;TZID=Europe/Amsterdam:20090209T163000
LOCATION:Room 6.96, HG (Main Building), TU Eindhov
 en
DESCRIPTION:In this talk I will report on a joint 
 work with Bart Jacobs on examples of expressivity 
 of modal logics. We investigate expressivity of mo
 dal logics for transition systems, multitransition
  systems, Markov chains, and Markov processes, as 
 coalgebras of the powerset, finitely supported mul
 tiset, finitely supported distribution, and measur
 e functor, respectively. Expressivity means that l
 ogically indistinguishable states, satisfying the 
 same formulas, are behaviourally indistinguishable
  too. The investigation is based on the framework 
 of dual adjunctions between spaces and logics and 
 focuses on a crucial injectivity property. The app
 roach is generic both in the choice of systems and
  modalities, and in the choice of a ``base logic''
 . Most of these expressivity results are already k
 nown, but the applicability of the uniform setting
  of dual adjunctions to these particular examples 
 is what constitutes the contribution of this work.
  In addition, we observed an interesting compariso
 n of the mentioned types of systems, in particular
  of Markov chains and Markov processes.   For more
  information, see http://www.win.tue.nl/prose/
X-ALT-DESC;FMTTYPE=text/html:\n      <p>\nIn this 
 talk I will report on a joint work with Bart Jacob
 s on examples of expressivity of modal logics. We 
 investigate expressivity of modal logics for trans
 ition systems, multitransition systems, Markov cha
 ins, and Markov processes, as coalgebras of the po
 werset, finitely supported multiset, finitely supp
 orted distribution, and measure functor, respectiv
 ely.  Expressivity means that logically indistingu
 ishable states, satisfying the same formulas, are 
 behaviourally indistinguishable too. The investiga
 tion is based on the framework of dual adjunctions
  between spaces and logics and focuses on a crucia
 l injectivity property. The approach is generic bo
 th in the choice of systems and modalities, and in
  the choice of a ``base logic''. Most of these exp
 ressivity results are already known, but the appli
 cability of the uniform setting of dual adjunction
 s to these particular examples is what constitutes
  the contribution of this work. In addition, we ob
 served an interesting comparison of the mentioned 
 types of systems, in particular of Markov chains a
 nd Markov processes. \n      </p>\n    \n      <p>
 For more information, see \n        <a target="_bl
 ank" href="http://www.win.tue.nl/prose/">http://ww
 w.win.tue.nl/prose/</a>\n      </p>\n    
URL:/NewsandEvents/Archives/2009/newsitem/2721/9-F
 ebruary-2009-PROSE-Colloquium-Ana-Sokolova
END:VEVENT
END:VCALENDAR