BEGIN:VCALENDAR
VERSION:2.0
PRODID:icalendar-ruby
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:Europe/Vienna
BEGIN:DAYLIGHT
DTSTART:20170326T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:CEST
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20161030T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:CET
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260428T100321Z
UID:58ac3894cd32b607020342@ist.ac.at
DTSTART:20170321T170000
DTEND:20170321T183000
DESCRIPTION:Speaker: Swen Jacobs\nhosted by Tom Henzinger\nAbstract: Guarde
 d protocols\, as introduced by Emerson and Kahlon (2000)\, describe concur
 rent systems where transitions of processes are enabled or disabled depend
 ing on the existence of other processes in certain local states. Cutoff re
 sults reduce reasoning about systems with an arbitrary number of processes
  to systems of a determined\, fixed size. Our work is based on the observa
 tion that the existing cutoff results are i) of limited use for liveness p
 roperties because the reductions do not preserve fairness\, and ii) in man
 y cases give a prohibitively large cutoff. We provide new cutoff results t
 hat work under fairness assumptions\, and prove tightness or asymptotic ti
 ghtness for cutoffs that only depend on the size of the process templates.
  I will also report on ongoing work to obtain smaller cutoffs by consideri
 ng additional static properties of the process templates\, such as the num
 ber of different guards that are used in the template.
LOCATION:Seminar room Ground floor / Office Bldg West (I21.EG.128)\, ISTA
ORGANIZER:pnovotny@ist.ac.at
SUMMARY:Swen Jacobs: Cutoff Results for Guarded Protocols
URL:https://talks-calendar.ista.ac.at/events/380
END:VEVENT
END:VCALENDAR