BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:48e52709-81c8-4035-990d-8c709f216533
X-WR-CALNAME:[M2F] Emmanuel Filiot (ULB)
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20241027T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20221030T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20231029T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20220327T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20230326T020000
RDATE:20240331T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:48e52709-81c8-4035-990d-8c709f216533
DTSTAMP:20260411T131703Z
CLASS:PUBLIC
DESCRIPTION:** Reactive synthesis over infinite data domains.  **\n\nThis t
 alk presents reactive synthesis problems over infinite data domains. The g
 oal of reactive synthesis is to automatically generate\, from a specificat
 ion of valid executions\, a reactive system interacting with its environme
 nt\, which enforces only valid executions\, no matter what its environment
  does. There is an extensive literature on reactive synthesis from regular
  specifications\, which semantically are regular languages of infinite wor
 ds over a finite alphabet. This talk intends to give an overview of severa
 l extensions of synthesis to the more general setting of infinite alphabet
 s\, allowing to model data (e.g. integers)\, an aspect which is usually ig
 nored by classical reactive synthesis methods.\n\nThe presented work is ba
 sed on a collaboration with Léo Exibard\, Ayrat Khalimov and Pierre-Alain 
 Reynier.
DTSTART;TZID=Europe/Paris:20230314T140000
DTEND;TZID=Europe/Paris:20230314T150000
LOCATION:LaBRI
SEQUENCE:0
SUMMARY:[M2F] Emmanuel Filiot (ULB)
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR
