The paper is presented a response to the S.P. Prokhorov’s paper “The Fundamental Contribution of the USSR Academy of Sciences to the Development of Computer Sciences and Computer Technologies” in the “Bulletin of the Russian Academy of Sciences”, 2023, vol. 93, no. 10, pp. 980–988.

The paper is presented the results of the VI International conference on the history of computer science “Development of computer technology in Russia, the countries of the former USSR and CMEA” SoRuCom-23. It was organized on September 25–27, 2023 at the Nizhny Novgorod campus of the National Research University “Higher School of Economics”.

Dense-Time Petri nets (TPNs) are an extension of Petri nets where each transition has its own clock and time interval. This model is considered in the context of a weak semantics, in which time elapsing does not force transitions to fire. For TPNs, equivalences are investigated in the dichotomies of "interleaving — partial order" and "linear — branching time". The relationships between equivalences are analyzed with respect to intermediate and persistent atomic memory policies, which determine the rules for resetting the clocks of transitions.