?
Resource Bisimilarity in Petri Nets is Decidable
Fundamenta Informaticae. 2022. Vol. 186. No. 1-4. P. 175–194.
Petri nets are a popular formalism for modeling and analyzing distributed systems. Tokens in Petri net models can represent the control flow state or resources produced/consumed by transition firings. We define a resource as a part (a submultiset) of Petri net markings and call two resources equivalent when replacing one of them with another in any marking does not change the observable Petri net behavior. We consider resource similarity and resource bisimilarity, two congruent restrictions of bisimulation equivalence on Petri net markings. Previously it was proved that resource similarity (the largest congruence included in bisimulation equivalence) is undecidable. Here we present an algorithm for checking resource bisimilarity, thereby proving that this relation (the largest congruence included in bisimulation equivalence that is a bisimulation) is decidable. We also give an example of two resources in a Petri net that are similar but not bisimilar.
Publication based on the results of:
Савченко В. В., Savchenko L., Измерительная техника 2026 Т. 75 № 3 С. 105–113
Within the framework of a current area of research in the field of speech acoustics – non-invasive analysis of speech
production processes – the acute problem of insufficient accuracy of parametric methods for coding a turbulent (noise) type voice source is considered. In order to overcome this problem, a method for coding a sound source with increased ...
Added: September 11, 2026
Фирсанова В. И., Journal of Mathematical Sciences 2024 Vol. 285 No. 1 P. 112–125
Text-to-image models use user-generated prompts to produce images. Such text-to-image models as DALL-E 2, Imagen, Stable Diffusion, and Midjourney can generate photorealistic or similar to human-drawn images. Apart from imitating human art, large text-to-image models have learned to produce combinations of pixels reminiscent of captions in natural languages. For example, a generated image might contain ...
Added: September 9, 2026
Фирсанова В. И., Человек: образ и сущность. Гуманитарные аспекты 2025 Vol. 2 No. 62 P. 203–214
Abstract. The paper highlights prompt engineering in academic setting to reduce plagiarism and increase students' interest. The research problem is the lack of a unified methodology for using artificial intelligence in education. The paper aims to create a generative artificial intelligence user interface, the Virtual Teaching Assistant. Teachers were interviewed, the first collection of presets ...
Added: September 9, 2026
Вохминцев И. В., Вестник международных организаций: образование, наука, новая экономика 2026 Т. 21 № 2
The EAEU and the CSTO are Russia’s principal regional international organisations. Understanding, assessing, and analysing the foreign-policy positions of the countries that belong to them is a matter of the state’s national interests. This determines the purpose of the study: to identify the level and the form of cohesion in the voting of EAEU and ...
Added: September 7, 2026
Alshanskaia E., Portnova G., Liaukovich K. et al., Frontiers in Neuroscience 2024 Vol. 18
Added: September 7, 2026
Зуенко Д. О., Trofimova E., Хайдарова И., IEEE Access 2026 Vol. 14 P. 121339–121357
Oil spill segmentation in Synthetic Aperture Radar (SAR) images is limited by noisy annotations in publicly available datasets and by architectural choices that interact with label quality in opposing directions. First, we introduce a manually refined version of the Deep-SAR Oil Spill (SOS) dataset, in which 36.25% of masks are corrected for false positives, missed ...
Added: September 7, 2026
Kelbert M., Statistics 2026 Vol. 60
We present variational representations for the weighted divergencies
and exponential error function, and discuss implications for the
statistical inference and entropic optimal transport. ...
Added: September 7, 2026
Неверов В. Д., Красавин А. В., Vagov A. et al., Physical Review B: Condensed Matter and Materials Physics 2026 Vol. 113 P. 1–6
We develop a neural network approach to solve the self-consistent Bogoliubov-de Gennes equations in strongly disordered s-wave superconductors. The method accurately reproduces inhomogeneous gap distributions and generalizes to system sizes far larger than those used in training. It reduces computational scaling from O(N6 ) to O(N2), enabling quantitative analysis of percolation phenomena and the superconductor-insulator ...
Added: September 5, 2026
Sheshukova M., Durmus A., Khusainov M. et al., Statistics 2026 P. 1–25
In this paper, we consider the problem of Gaussian approximation for the online linear regression task. We derive the corresponding rates for the setting of a constant stepsize and study the explicit dependence of the convergence rate on the problem dimension d and quantities related to the design matrix. When the number of iterations n is known in advance, ...
Added: September 4, 2026
Proceedings of Machine Learning Research , 2026.
Added: September 4, 2026
Khodadoust J., Kulikova S., Khodadoust F., Biomedical Signal Processing and Control 2027 Vol. 129 P. 111284–111284
Acute ischemic stroke (AIS) analysis from two-dimensional (2D) clinical imaging is hindered by uncontrolled slice tilt and geometric inconsistencies that violate the assumptions of pose-agnostic deep learning (DL) models. This paper proposes a unified geometry-aware, frequency-domain framework for tilted slice localization and ischemic stroke segmentation that explicitly decouples pose estimation from lesion analysis. The method ...
Added: September 2, 2026
IEEE, 2026.
On behalf of the Organizing Committee, it is my great pleasure to extend a warm
welcome to all participants of the Fourth International IEEE Conference on
Distributed Computing and High-Performance Computing (DCHPC 2026), held
in Tehran from May 10–11, 2026. This conference is jointly organized by the
School of Computer Science at the Institute for Research in Fundamental
Sciences (IPM) ...
Added: September 2, 2026
S.M. Avdoshin, Patrushev K. A., Proceedings of the Institute for System Programming of the RAS 2026 Vol. 38 No. 4-2 P. 245–256
The cardinality-constrained Markowitz problem is NP-hard and traditionally solved with commercial MIQP solvers. Following the 2022 export restrictions that rendered both commercial MIQP software and cloud quantum platforms (IBM Quantum, D-Wave Leap) inaccessible from the Russian Federation, practitioners require open-source alternatives. This paper systematically compares three solver families for the discrete mean-variance problem: two open-source ...
Added: August 27, 2026
Zaikin A., Vlasenko D., Zakharov D. et al., Diagnostics 2026 Vol. 16 No. 17 P. 1–15
Background/Objectives: Synolitic graphs (SGs) were developed for task-based fMRI, where
edge weights encode the discriminative power of pairwise regional features; whether similar
information can be recovered from resting-state data was untested. We benchmarked
SGs for autism spectrum disorder (ASD) classification using the multisite ABIDE-I dataset
(871 subjects: 403 subjects with ASD, 468 typical controls; 17 sites; CC200 atlas). Methods:
Using ...
Added: August 27, 2026
Тула: Тульский государственный педагогический университет им. Л.Н. Толстого, 2025.
Сборник содержит материалы, представленные на XXIV Международной конференции «Алгебра, теория чисел, дискретная геометрия и многомасштабное моделирование: современные проблемы, приложения и проблемы истории», посвящённой 110-летию со дня рождения академика Юрия Владимировича Линника и 110-летию со дня рождения профессора Андрея Борисовича Шидловского и 80-летию со дня рождения профессора Геннадия Ивановича Архипова. Материалы конференции будут полезны научным работникам, ...
Added: August 27, 2026
Eduard Sopin, Nazarin A., Begishev V. et al., IEEE Transactions on Vehicular Technology 2026 Vol. 75 No. 6 P. 10995–11007
Aimed at rate-greedy applications having extreme requirements for the data rate at the air interface, 5G New Radio (NR) systems may experience problems when the number of user equipment (UE) in the coverage of the cell increases due to limited capacity of the physical downlink control channel (PDCCH).The aim of this study is to explore ...
Added: August 26, 2026
Rybakov M., Annals of Pure and Applied Logic 2026 Vol. 177 No. 10 Article 103811
The paper presents a solution to the question about the decidability of the two-variable fragment of the superintuitionistic predicate logic QLC defined by the class of linear Kripke frames, which is also the ‘superintuitionistic’ fragment of the modal predicate logic QS4.3, under the Gödel translation. We prove that the fragment is undecidable. The result remains true for the ...
Added: July 11, 2026
Shehtman V. B., Gagarin A., , in: Graph Games and Logic Design. Recent Developments and Further Directions. (TREN, volume 66)Vol. 66.: Springer, 2026. Ch. 17 P. 419–450.
The chapter contains an overview of results on products of propositional modal logics and related constructions: semiproducts, Segerberg squares, and others. We focus mainly on axiomatizations, finite model property, and decidability; we also sketch connections with classical and modal predicate logics. In some cases we give ideas of proofs, especially of those using games. ...
Added: June 30, 2026
Springer, 2026.
This book presents established and new research on the close connections between graph games and systems of logic, particularly existing and newly designed modal logics. The volume utilizes two graph games – the sabotage game and the hide-and-seek game – to demonstrate the natural interplay between designing new graph games and exploring new kinds of ...
Added: June 30, 2026
Speranski S. O., Journal of Logic and Computation 2013 Vol. 23 No. 5 P. 1035–1055
In the present article, the quantifiers over propositions are first introduced into the language for reasoning about probability, then the complexity issues for validity problems dealing with the corresponding hierarchy of probabilistic sentences are investigated. We prove, among other things, the $\Pi^1_1$-completeness for the general validity and also indicate the least level in the hierarchy ...
Added: December 27, 2025
Speranski S. O., Archive for Mathematical Logic 2013 Vol. 52 No. 5–6 P. 507–516
We carry out a study of definability issues in the standard models of Presburger and Skolem arithmetics (henceforth referred to simply as Presburger and Skolem arithmetics, for short, because we only deal with these models, not the theories, thus there is no risk of confusion) supplied with free unary predicates — which are strongly related to definability in ...
Added: December 27, 2025
Speranski S. O., Izvestiya. Mathematics 2025 Vol. 89 No. 3 P. 609–627
Let QPL-e expand the quantifier-free ‘polynomial’ probability logic of [Fagin et al. 1990] by adding quantifiers over arbitrary events; it can be viewed as a one-sorted elementary language for reasoning about probability spaces. We prove that the $\Sigma_2$-fragment of the QPL-e-theory of finite spaces is hereditarily undecidable. By earlier observations, this implies that $\Pi_2$ is the ...
Added: December 26, 2025
Speranski S. O., Logic Journal of the IGPL 2025 Vol. 33 No. 2 Article jzae042
This paper is concerned with a two-sorted probabilistic language, denoted by QPL, which contains quantifiers over events and over reals, and can be viewed as an elementary language for reasoning about probability spaces. The fragment of QPL containing only quantifiers over reals is a variant of the well-known ‘polynomial’ language from [Fagin et al. 1990, Section 6]. ...
Added: December 26, 2025
Rybakov M., Shkatov D., Studia Logica 2025 Vol. 113 P. 1–48
In the early 1960s, to prove undecidability of monadic fragments of sublogics of the predicate modal logic QS5 that include the classical predicate logic QCl, Saul Kripke showed how a classical atomic formula with a binary predicate letter can be simulated by a monadic modal formula. We consider adaptations of Kripke's simulation, which we call the Kripke trick, to various modal ...
Added: December 2, 2023