BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:b623b139-996f-4f36-be29-e9566d1ebf7d
X-WR-CALNAME:[M2F] 'Reduction of Discrete Dynamical Systems over Monoids' -
  Georgios Argyris (DTU Copenhagen)
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20240331T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20211031T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20221030T030000
RDATE:20231029T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20220327T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20230326T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:b623b139-996f-4f36-be29-e9566d1ebf7d
DTSTAMP:20260910T083627Z
CLASS:PUBLIC
DESCRIPTION:Discrete-time Dynamical Systems (DS) are a popular framework fo
 r modeling biological processes. However\, the increasing number of DS’s v
 ariables hampers the analysis of the underlying biological process. We pro
 pose a technique called Forward Bisimulation (FB) for reduction of discret
 e-time DSs. The presentation consists of 3 parts: (i) We will explain the 
 Boolean Network (BN)\, its utility on the modeling of a real biological sy
 stem\, and how reduction can facilitate the analysis. (ii) We will very br
 iefly provide a mini review of the existing methods in the case of Boolean
  Network reduction. (iii) BNs are essentially discrete-time DSs whose vari
 ables take valuations in the Boolean Domain B. In this last part\, we will
  reduce a BN with FB over the monoid (B\,\/)\, and we will generalize the 
 theory to some arbitrary DSs over monoids.
DTSTART;TZID=Europe/Paris:20220628T130000
DTEND;TZID=Europe/Paris:20220628T140000
LOCATION:LaBRI\, 178
SEQUENCE:0
SUMMARY:[M2F] 'Reduction of Discrete Dynamical Systems over Monoids' - Geor
 gios Argyris (DTU Copenhagen)
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR