BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:47f71e59-6d4c-4be2-8048-fbb30ec37032
X-WR-CALNAME:[MTV] Léo Henry (LIS\, U. Marseille) - Compositional Active Le
 arning of Synchronizing Systems Through Automated Alphabet Refinement
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:47f71e59-6d4c-4be2-8048-fbb30ec37032
DTSTAMP:20260404T110301Z
CLASS:PUBLIC
DESCRIPTION:Active automata learning infers automaton models of systems fro
 m behavioral observations\, a technique successfully applied to a wide ran
 ge of domains. Compositional approaches for concurrent systems have recent
 ly emerged. This talk presents a new framework allowing to take a signific
 ant step beyond available results and develop a general technique for comp
 ositional learning of a synchronizing parallel system with an unknown deco
 mposition. The approach automatically refines the global alphabet into com
 ponent alphabets while learning the component models. It is based on the d
 evelopment of a theoretical treatment of distributions of alphabets\, i.e.
 \, sets of possibly overlapping component alphabets. This allows to charac
 terize counter-examples that reveal inconsistencies with global observatio
 ns\, and show how to systematically update the distribution to restore con
 sistency. Based on this theory\, a compositional learning algorithm implem
 enting these ideas is presented\, where learning counterexamples precisely
  correspond to distribution counterexamples under well-defined conditions.
 Finally\, some experiments are presented\, showing that in more than 630 s
 ubject systems\, the implementation of this new algorithm delivers orders 
 of magnitude improvements (up to five orders) in membership queries and in
  systems with significant concurrency\, it also achieves better scalabilit
 y in the number of equivalence queries.\n\n\nImport automatique depuis htt
 ps://framagenda.org/remote.php/dav/public-calendars/D3yqF7nwys9amfyY?expor
 t par sync_icals_to_drupal.py pour M2F
DTSTART;TZID=Europe/Paris:20260108T130000
DTEND;TZID=Europe/Paris:20260108T140000
LOCATION:LaBRI\, salle 178
SEQUENCE:0
SUMMARY:[MTV] Léo Henry (LIS\, U. Marseille) - Compositional Active Learnin
 g of Synchronizing Systems Through Automated Alphabet Refinement
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR
