BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
TZID:Europe/Paris
X-WR-TIMEZONE:Europe/Paris
BEGIN:VEVENT
UID:489@i2m.univ-amu.fr
DTSTART;TZID=Europe/Paris:20141204T110000
DTEND;TZID=Europe/Paris:20141204T123000
DTSTAMP:20141119T100000Z
URL:https://www.i2m.univ-amu.fr/evenements/transition-systems-over-games/
SUMMARY: (...): Transition systems over games
DESCRIPTION:: We describe a framework for game semantics combining operatio
 nal and denotational accounts. A game is a bipartite graph of “passive
 ” and “active” positions\, or a categorical variant with morphisms b
 etween positions.The operational part of the framework is given by a label
 led transition system in which each state sits in a particular position of
  the game. From a state in a passive position\, transitions are labelled w
 ith a valid O-move from that position\, and take us to a state in the upda
 ted position. Transitions from states in an active position are likewise l
 abelled with a valid P-move\, but silent transitions are allowed\, which m
 ust take us to a state in the same position.The denotational part is given
  by a “transfer” from one game to another\, a kind of program that con
 verts moves between the two games\, giving an operation on strategies. The
  agreement between the two parts is given by a relation called a “steppe
 d bisimulation”.The framework is illustrated by an example of substituti
 on within a lambda-calculus.(Joint work with Sam Staton)[http://www.cs.bha
 m.ac.uk/~pbl/]
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:STANDARD
DTSTART:20141026T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
END:VTIMEZONE
END:VCALENDAR