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/2018/newsitem/9889/1-M
 ay-2018-ILLC-Seminar-Bahareh-Afshari
DTSTAMP:20190307T164611
SUMMARY:ILLC Seminar, Bahareh Afshari
ATTENDEE;ROLE=Speaker:Bahareh Afshari
DTSTART;TZID=Europe/Amsterdam:20180501T110000
DTEND;TZID=Europe/Amsterdam:20180501T115000
LOCATION:ILLC Seminar Room F1.15, Science Park 107
 , Amsterdam
DESCRIPTION:Modal logic provides an effective lang
 uage for expressing  properties of state-based sys
 tems. When equipped with operators  that can test 
 for infinite behaviour like looping and  reachabil
 ity, the logic becomes a powerful tool for specify
 ing  correctness of nonterminating, reactive proce
 sses such as  communication protocols and control 
 systems. An elegant example  of such a logic is th
 e modal mu-calculus which extends basic  modal log
 ic by two quantifiers for defining inductive and  
 co-inductive operators. As well as being highly ex
 pressive, this  logic enjoys good computational pr
 operties (decidability, finite  model property, …)
  that distinguish it as a central logic in  comput
 er science. In this talk I will introduce the moda
 l  mu-calculus, present some key properties and di
 scuss recent  results regarding its proof theory.
X-ALT-DESC;FMTTYPE=text/html:\n  <p>Modal logic pr
 ovides an effective language for expressing<br>\n 
  properties of state-based systems. When equipped 
 with operators<br>\n  that can test for infinite b
 ehaviour like looping and<br>\n  reachability, the
  logic becomes a powerful tool for specifying<br>\
 n  correctness of nonterminating, reactive process
 es such as<br>\n  communication protocols and cont
 rol systems. An elegant example<br>\n  of such a l
 ogic is the modal mu-calculus which extends basic<
 br>\n  modal logic by two quantifiers for defining
  inductive and<br>\n  co-inductive operators. As w
 ell as being highly expressive, this<br>\n  logic 
 enjoys good computational properties (decidability
 , finite<br>\n  model property, …) that distinguis
 h it as a central logic in<br>\n  computer science
 . In this talk I will introduce the modal<br>\n  m
 u-calculus, present some key properties and discus
 s recent<br>\n  results regarding its proof theory
 .</p>\n
URL:/NewsandEvents/Archives/2018/newsitem/9889/1-M
 ay-2018-ILLC-Seminar-Bahareh-Afshari
CONTACT:Yde Venema at Y.Venema at uva.nl
END:VEVENT
END:VCALENDAR