BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:46b64119-db18-4f4a-bfe2-23346746f089
X-WR-CALNAME:[MTV] Corto Mascle - Parameterized Broadcast Networks with Reg
 isters
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20250330T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20221030T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20231029T030000
RDATE:20241027T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20230326T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20240331T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:46b64119-db18-4f4a-bfe2-23346746f089
DTSTAMP:20260408T124127Z
CLASS:PUBLIC
DESCRIPTION:We consider the parameterized verification of arbitrarily large
  networks of agents which communicate\nthrough unreliable broadcasts. In a
 ddition\, agents have local registers which are initially distinct and may
  therefore be thought of as identifiers.\nAgents may append register value
 s to their messages\, store the ones they receive and apply (in)equality t
 ests.\nIn the talk\, we will see how we can apply well quasi-orders to obt
 ain decidability of the coverability problem for such systems\, starting w
 ith a relevant easier subcase.\nOn the other hand\, we will see that other
  classical problems\, such as the target problem\, where all processes mus
 t synchronize on a given state\, are undecidable.\nBy contrast\, those pro
 blems fall in NP when processes only have access to one register.\nThis is
  joint work with Lucie Guillou and Nicolas Waldburger.
DTSTART;TZID=Europe/Paris:20230608T130000
DTEND;TZID=Europe/Paris:20230608T140000
LOCATION:salle 178\, zoom: https://bordeaux-inp-fr.zoom.us/j/89508306159
SEQUENCE:0
SUMMARY:[MTV] Corto Mascle - Parameterized Broadcast Networks with Register
 s
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR
