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

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

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

Email: computerscience@hse.ru

 

Administrations
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
Article
Infinite transitivity, finite generation, and Demazure roots

Arzhantsev I., Kuyumzhiyan K., Zaidenberg M.

Advances in Mathematics. 2019. Vol. 351. P. 1-32.

Article
Bias in False Discovery Rate Estimation in Mass-Spectrometry-Based Peptide Identification

Sulimov P., Voronkova A., Danilova Y. et al.

Journal of Proteome Research. 2019. Vol. 18. No. 5. P. 2354-2358.

Article
Compression of recurrent neural networks for efficient language modeling

Grachev A., Ignatov D. I., Savchenko A.

Applied Soft Computing Journal. 2019. Vol. 79. P. 354-362.

Book chapter
Numerical Pattern Mining Through Compression

Makhalova T., Kuznetsov S., Napoli A.

In bk.: 2019 Data Compression Conference Proceedings. IEEE, 2019.

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