BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:04cc9f8c-7640-4ab4-a2c4-4e89c42f99b9
X-WR-CALNAME:[MTV] Alexis Reynouard - Implementing the Surprise Effect in T
 imed Games
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20251026T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20231029T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20241027T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20230326T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20240331T020000
RDATE:20250330T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:04cc9f8c-7640-4ab4-a2c4-4e89c42f99b9
DTSTAMP:20260418T183751Z
CLASS:PUBLIC
DESCRIPTION:We are interested in tools for synthesizing strategies in timed
  games with parity objective.\n\nFrom a theoretical point of view\, we def
 ine and interpret these games as in the paper The Element of Surprise by L
 uca de Alpharo et al. (CONCUR 2003). This paper highlights several subtlet
 ies of timed games. They can be summarized as follows: representing a time
 d parity game by an interleaving of waiting steps (continuous transition) 
 and actions (discrete transition) does not capture the strategies that req
 uire to be the fastest (as in a cowboy duel). Such strategies are called s
 urprise strategies and do not have equivalent no-surprise strategies. Thus
 \, taking surprise into account changes the game\, i.e.\, the winner may b
 e different depending on whether we consider surprise strategies.\n\nTo ou
 r knowledge\, the results of this paper have not been implemented in concr
 ete tools. The paper does not propose an explicit construction or other im
 plementation methods\, and UppAal\, a well-known timed game solver\, consi
 ders a different semantics and focuses on reachability and safety objectiv
 es.\n\nWe therefore propose an explicit construction corresponding to the 
 work of de Alpharo et al. and present its use in Zielonka’s procedure for 
 solving timed parity games. We believe that a tool for experimenting with 
 new semisymbolic algorithms on timed games would benefit the community.\n
 \nTChecker is a project built in this sense and is in active development f
 or at least eight years. However\, it is a model checker: it does not yet 
 support games. Therefore\,\ntogether with Gilles Geeraerts* \, Jean-Franço
 is Raskin* \, and Frédéric Herbreteau** \, we are working on integrating g
 ame support into TChecker and implementing our timed Zielonka’s algorithm 
 there as a proof of concept.\n\n* Université Libre de Bruxelles\n** Bordea
 ux INP / LaBRI
DTSTART;TZID=Europe/Paris:20231127T100000
DTEND;TZID=Europe/Paris:20231127T110000
LOCATION:salle 178\, zoom: https://bordeaux-inp-fr.zoom.us/j/89508306159
SEQUENCE:0
SUMMARY:[MTV] Alexis Reynouard - Implementing the Surprise Effect in Timed 
 Games
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR
