skip to content
 

Seminars (LAAW06)

Videos and presentation materials from other INI events are also available.

Search seminar archive

Event When Speaker Title Presentation Material
LAAW06 3rd July 2006
09:00 to 10:25
Dynamic-epistemic logic of games
LAAW06 3rd July 2006
10:30 to 10:45
Game quantification on automatic structures and hierarchical games
LAAW06 3rd July 2006
11:30 to 12:00
Towards the Wadge hierarchy of weak alternating tree automata
LAAW06 3rd July 2006
12:00 to 12:30
Are parity games spineless?
LAAW06 3rd July 2006
14:00 to 14:30
T Colcombet Ramseyan factorisation for trees
LAAW06 3rd July 2006
14:30 to 14:45
M Samuelides Pebble tree-walking automata
LAAW06 3rd July 2006
14:45 to 15:00
A hierachy of automatically presentable omega-words having a decidable MSO theory
LAAW06 3rd July 2006
15:30 to 16:00
On distributed synthesis of discrete systems
LAAW06 3rd July 2006
16:00 to 16:30
Solving fixpoint equations in omega-continuous semirings: Some ideas and many questions
LAAW06 3rd July 2006
16:30 to 17:00
On size versus number of variables
LAAW06 4th July 2006
09:00 to 10:25
Mechanism design
LAAW06 4th July 2006
10:30 to 11:00
Stable partitions in coalition games
LAAW06 4th July 2006
11:30 to 12:00
From discounting to parity games
LAAW06 4th July 2006
12:00 to 12:30
H Gimbert Positional stochastic games
LAAW06 4th July 2006
14:00 to 14:30
Recursive concurrent stochastic games
LAAW06 4th July 2006
14:30 to 15:00
Backwards induction for games of infinite horizon
LAAW06 4th July 2006
15:30 to 16:55
Hypertree decompositions
LAAW06 5th July 2006
09:00 to 10:25
Games as an algorithmic construct
LAAW06 5th July 2006
10:30 to 11:00
Y Venema Coalgebra automata
LAAW06 5th July 2006
11:30 to 12:00
S Froschle When is secrecy decidable?
LAAW06 5th July 2006
12:00 to 12:15
Finitary parity and streett games
LAAW06 5th July 2006
12:15 to 12:30
S Lasota Faster algorithm for bisimulation equivalence of normed context-free processes
LAAW06 6th July 2006
09:00 to 10:25
Nested words and trees
LAAW06 6th July 2006
10:30 to 11:00
Game semantics and automata
LAAW06 6th July 2006
11:30 to 12:00
Verifying concurrent message-passing C programs with recursive calls
LAAW06 6th July 2006
12:00 to 12:15
K Rozier Algorithms for automata-theoretic linear temporal logic model checking
LAAW06 6th July 2006
12:15 to 12:30
Experimental evaluation of complementation of non-deterministic Buechi automata
LAAW06 6th July 2006
14:00 to 14:30
Optimality equations and strategy improvement for average payoff games
LAAW06 6th July 2006
14:30 to 14:45
A Trivedi A strategy improvement algorithm for optimal time reachability games
LAAW06 6th July 2006
14:45 to 15:00
Communicating timed automata
LAAW06 6th July 2006
15:30 to 16:00
Proving liveness by backwards reachability
LAAW06 6th July 2006
16:00 to 16:30
Model checking games for fixpoint logic with Chop
LAAW06 7th July 2006
09:00 to 10:25
Deterministic grammars
LAAW06 7th July 2006
10:30 to 11:00
R Lazic On LTL with the freeze quantifier and register automata
LAAW06 7th July 2006
11:30 to 12:00
Are one-player games always simple?
LAAW06 7th July 2006
12:00 to 12:30
Tree algebras
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons