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

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


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

Book chapter
A Logical Framework with Commutative and Non-commutative Subexponentials

Kanovich M., Kuznetsov S., Nigam V. et al.

In bk.: IJCAR: International Joint Conference on Automated Reasoning Automated Reasoning 9th International Joint Conference, IJCAR 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 14-17, 2018, Proceedings. Springer, 2018. P. 228-245.

On the exponentially weighted aggregate with the Laplace prior

Dalalyan A., Grappin E., Paris Q.

The annals of statistics. 2018. Vol. 46. No. 5. P. 2452-2478.

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.