11, Pokrovsky boulevard.
Phone: +7 (495) 531-00-00 *27254
Savostianov A., Shapoval S., Shnirman M.
Communications in Nonlinear Science and Numerical Simulation. 2020. Vol. 83. P. 105149.
Balkanova O., Chatzakos D., Cherubini G. et al.
Transactions of the American Mathematical Society. 2019. Vol. 372. No. 8. P. 5355-5374.
E. V. Maiewski, Kislov R. A., Khabarova O. V. et al.
Astrophysical Journal. 2020. Vol. 892. No. 1. P. 1-17.
Afanasiev A., Krivonozhko V., Lychev A. et al.
Journal of Global Optimization. 2020. Vol. 76. P. 563-574.
Ahidar-Coutrix A., Le Gouic T., Paris Q.
Probability Theory and Related Fields. 2020.
16 October 2018, 18:10, room 205 (Kochnovskii proezd, 3)
Luca Bernardinello (University of Milano-Bicocca)
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.