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.

Reversible computing is a new paradigm that extends the traditional forwards-only computing mode with the ability to execute in backwards, so that computation can run in reverse as easily as in forward. Event structures are a well-established model in concurrency theory and so they are widely used to establish relationships between different models. Two approaches to developing transition system (automaton-like) semantics for event structure models are distinguished in the literature. In the first case, states are considered as configurations (sets of already executed events), and transitions between states are built by starting from the initial configuration and repeatedly adding executable events. In the second approach, states are understood as residuals (model fragments that have not yet been executed), and transitions are created as residual structures are built. The present paper focuses on an investigation of how the two approaches are interrelated for the model of prime event structures extended with causal reversibility. The bisimilarity of the resulting transition systems is proved, taking into account step semantics of the model under consideration.

The paper presents a method for describing the operational semantics of programming languages. It is based on a domain-specific language designed to specify executable specifications for programming language constructs. This language is an extension of the Lisp language. The peculiarity of the method is to set the semantics for the program model, and not for the program itself. Since the specifications are executable, the method actually allows to ‘program‘ the semantics of programming languages. The method can be used in teaching computer languages, as well as in creating new programming languages, since it allows you to describe the constructions of a new language immediately at the level of an abstract syntactic tree.

Dealing with genomes, considering the distribution of mathematically determined sequences, looking for stable possible subchains, searching in general as a software problem by various criteria, are ones of the most necessary tasks when handling with actual research tools in the virology area. The range of urgent objectives currently includes the creation of new primers for virus diagnostics on stable areas of the genome and determination of the virus mutation sets, classification and clustering of the accumulated material for more accurate research, further mutation directions, etc. Computing complexes construction based on databases and the expansion of their functionality using online technologies, as well as the launch of server applications, is a function of the practical section in the field of programming for more efficient work of virologists and specialists from relevant fields in the areas of diagnostics and treatment of viral diseases.