RUS  ENG
Full version
JOURNALS // Avtomatika i Telemekhanika // Archive

Avtomat. i Telemekh., 2014 Issue 8, Pages 19–36 (Mi at14104)

This article is cited in 14 papers

Mathematical Game Theory and Applications

Paradigm of computations on the Petri nets

D. A. Zaitsev

International Humanitarian University, Odessa, Ukraine

Abstract: The paradigm of computations on the Petri nets was shown to appreciably speed up the computations and reduce laboriousness of software development owing to the mass parallelism and asynchronous information processing. A language of the programmed Petri nets was developed, alternative approaches to realizing the paradigm at the micro and macro levels were proposed, and the estimates of complexity of the earlier universal Petri net that are prototypes of the corresponding processor were specified. Indicated were the lines of practical realization of the paradigm such as the development of the technology of programming on the loaded Petri net, technology of translation of the loaded Petri nets to the inhibitory Petri nets, and the efficient hardware processors executing programs in the language of the inhibitory Petri nets. Fast computations are supported by the nets of the Sleptsov class with multiple start of transition at a step.

Presented by the member of Editorial Board: A. A. Lazarev

Received: 16.11.2013


 English version:
Automation and Remote Control, 2014, 75:8, 1369–1383

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024