• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

125319, Moscow,
3 Kochnovsky Proezd (near metro station 'Aeroport'). 

Phone: +7 (495) 772-95-90 *12332

Email: computerscience@hse.ru



Dean Ivan Arzhantsev

First Deputy Dean Tamara Voznesenskaya

Deputy Dean for Research and International Relations Sergei Obiedkov

Deputy Dean for Methodical and Educational Work Ilya Samonenko

Deputy Dean for Development, Finance and Administration Irina Plisetskaya

Aug 26 – Aug 30
Registration and Poster Submission deadline — May 1, 2019 
On the prediction loss of the lasso in the partially labeled setting

Bellec P., Dalalyan A., Grappin E. et al.

Electronic journal of statistics. 2018. Vol. 12. No. 2. P. 3443-3472.

On the Structure of Ammann A2 Tilings
In press

Durand B., Shen A., Vereshchagin N.

Discrete and Computational Geometry. 2019. P. 1-30.

Ontology–based access to temporal data with ontop: a framework proposal

Zakharyaschev M. et al.

International Journal of Applied Mathematics and Computer Science. 2019. Vol. 29. No. 1. P. 17-30.

Colloquium: Asynchronous games for Petri nets. Speaker: Luca Bernardinello (University of Milano-Bicocca)

Event ended

16 October 2018, 18:10, room 205 (Kochnovskii proezd, 3)

Luca Bernardinello (University of Milano-Bicocca)

Asynchronous games for Petri nets

Games on graphs and on trees have been used in the fields of semantics and verification. Usually, they are defined as sequential games, where a play is a sequence of moves by the players.

However, when synthesizing or analyzing distributed systems, in which events happen concurrently and the global state is not observable, this approach is not always appropriate, since concurrency is hidden in the interleaving of events. Therefore, several kinds of games in which the players can move asynchronously have been proposed in recent years. I will present an attempt to define such a game, originally conceived in order to tackle the problem of “observable liveness”, in which an agent tries to control a Petri net so that a given transition will fire over and over, assuming that only a subset of the transitions is directly controllable.