What is Place-Transition Net

Motivation for new models of hyper-computations was presented. Sleptsov net was introduced compared to Petri and Salwicki nets. A concept of universal Sleptsov net, as a prototype of a processor in Sleptsov net computing, was discussed. Small universal Sleptsov net that runs in polynomial time was constructed; it consists of 15 places and 29 transitions. Principles of programming in Sleptsov nets, as composition of reverse control flow and data, have been developed. Standard control flow patterns include sequence, branching, loop, and parallel execution. Basic modules, which implement efficiently copying, logic, and arithmetic operations, have been developed. Special dashed arcs were introduced for brief specification of input and output data of modules (subnets). Ways of hierarchical composition of a program via substitution of a transition by a module were discussed. Examples of Sleptsov net programs for data encryption, fuzzy logic, and partial differential equations have been presented. Enterprise implementation of Sleptsov net programming promises ultra-performance.