• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site
ФКН
Contacts

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

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

computerscience@hse.ru

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

Events
Feb 22 – Feb 23
Регистрация открыта 
Mar 21 – Mar 23
Papers Submission Deadline: 15 January 2019 
Jun 12 – Jun 14
submission: Friday, 01 February 2019, notification: Friday, 15 February 2019 
Aug 26 – Aug 30
Registration and Poster Submission deadline — April 1, 2019 
Article
Ontology-Mediated Queries: Combined Complexity and Succinctness of Rewritings via Circuit Complexity

Bienvenu M., Kikot S., Kontchakov R. et al.

Journal of the ACM. 2018. Vol. 65. No. 5. P. 28:1-28:51.

Article
Randomized Block Cubic Newton Method
In press

Doikov Nikita, Richtarik P.

Proceedings of Machine Learning Research. 2018. No. 80. P. 1290-1298.

Article
Particle-identification techniques and performance at LHCb in Run 2
In press

Hushchyn M., Chekalina V.

Nuclear Instruments and Methods in Physics Research, Section A: Accelerators, Spectrometers, Detectors and Associated Equipment. 2018. P. 1-2.

Article
Observational evidence in favor of scale free evolution of sunspot groups

Shapoval A., Le Mouël J., Shnirman M. et al.

Astronomy and Astrophysics. 2018. Vol. 618. P. A183-1-A183-13.

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.

Colloquium


Registration