Games in Verification and Control, and a Glimpse Beyond
-----------------------------------
          
ABSTRACT
-----------------------------------
Aceasta prezentare va include o incursiune istorica 
a perspectivei pe care teoria jocurilor o ofera asupra 
conceptului de interactiune in sisteme informatice, 
vorbind pe de o parte despre rezultate clasice, 
apropiate de teoria automatelor:
* Infinite games on finite structures
- Gale-Stewart games, determinacy of well-founded 
  and Borel games;
- games of conflict as models of alternating machines, 
  interactive proofs
- automata over infinite objects, MSO and the mu-calculus;
* Games between structures
- Ehrenfeuch-Fraisse games, bisimulation,
- simulation orders, interface theories
- Expressiveness measures
iar pe de alta parte despre dificultatile pe care acesta perspectiva le 
scoate la iveala, si despre cum se spera ca ar putea fi intampinate.
Mai multe detalii se gasesc la adresa:
www.lsv.ens-cachan.fr/~dwb
          
SPEAKER(S)
-----------------------------------
dr. Dietmar BERWANGER
Centre Nationale de la Recherche Scientifique (Laboratoire Specification
et Verification, ENS Cachan)
Franta
-----------------------------------
Dr. Dietmar Berwanger is a Research Fellow at CNRS 
France (LSV Cachan). Previously, he was in the Logic 
and Complexity group of Erich Gradel at RWTH Aachen 
University, at LaBRI Bordeaux and at EPFL Lausanne. 
His research is on logical and algorithmic foundations 
of interactive systems, in particular: theory of 
infinite games, fixed-point logics, \mu-calculus, 
verification and synthesis of open systems, 
graph structure theory and complexity.
-----------------------------------