BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:95ddb5fb-ddb4-41af-9ce8-9ecf74dd682f
X-WR-CALNAME:[MTV] Ocan Sankur (IRISA) - Timed Automata Verification and Sy
 nthesis via Finite Automata Learning
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:95ddb5fb-ddb4-41af-9ce8-9ecf74dd682f
DTSTAMP:20260406T024008Z
CLASS:PUBLIC
DESCRIPTION:We present algorithms for model checking and controller synthes
 is of timed automata\, seeing a timed automaton model as a parallel compos
 ition of a large finite-state machine and a relatively smaller timed autom
 aton\, and using compositional reasoning on this composition. We use autom
 ata learning algorithms to learn finite automata approximations of the tim
 ed automaton component\, in order to reduce the problem at hand to finite-
 state model checking or to finite-state controller synthesis. We present a
 n experimental evaluation of our approach.
DTSTART;TZID=Europe/Paris:20240201T130000
DTEND;TZID=Europe/Paris:20240201T140000
LOCATION:salle 178\, zoom: https://bordeaux-inp-fr.zoom.us/j/89508306159
SEQUENCE:0
SUMMARY:[MTV] Ocan Sankur (IRISA) - Timed Automata Verification and Synthes
 is via Finite Automata Learning
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR
