BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:829add53-79e0-4ebc-85f4-ba958a874f16
X-WR-CALNAME:[MTV] Clotilde Bizière (LaBRI) - Branching VASS are almost as 
 easy as VASS !
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20271031T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20251026T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20261025T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20250330T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20260329T020000
RDATE:20270328T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:829add53-79e0-4ebc-85f4-ba958a874f16
DTSTAMP:20260412T230827Z
CLASS:PUBLIC
DESCRIPTION:Vectors addition systems with states (VASS)\, a model equivalen
 t to Petri nets\, are finite-state machines with finitely many counters ra
 nging over the natural numbers. The decidable reachability problem for VAS
 S has many applications in logic\, automata\, and verification. With Jérôm
 e and Grégoire\, we studied the reachability problem for BVASS\, a branchi
 ng generalization of VASS. We show that BVASS reachability sets are very s
 imilar to VASS reachability sets\, namely that they are sections of VASS. 
 Our proof relies on a new well-quasi-order (wqo) on BVASS runs that genera
 lizes the well-known wqo on VASS runs. By leveraging an amalgamation prope
 rty\, we prove that every BVASS run can be transformed into an equivalent 
 one of bounded branching complexity. This allows us to derive several resu
 lts on the geometry of BVASS reachability sets.\n\n\nImport automatique de
 puis https://framagenda.org/remote.php/dav/public-calendars/D3yqF7nwys9amf
 yY?export par sync_icals_to_drupal.py pour M2F
DTSTART;TZID=Europe/Paris:20260226T130000
DTEND;TZID=Europe/Paris:20260226T140000
LOCATION:LaBRI\, salle 178
SEQUENCE:0
SUMMARY:[MTV] Clotilde Bizière (LaBRI) - Branching VASS are almost as easy 
 as VASS !
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR
