Add your Insight

Graphical programming languages are competing with traditional textual programming languages both in specific domains, for instance for programmable logical controllers, and for general purposes. Advantages of graphical languages have been proven by success of R-technology of programming and Drakon technology applied for space-shuttle project Buran. An advantage of a Petri net graph as a concurrent program skeleton is the developed for years toolset for the formal verification of concurrent programs. One research direction considers Petri net elements, in majority cases transitions, loaded by procedures written in a textual language. There are specific classes of nested nets that represent agent approach and object nets that allow encapsulation of objects. A class of infinite Petri nets is closely connected with cellular automata. Recently introduced generalization of a Petri net, called a Sleptsov net, runs fast and allows homogeneous mass parallel computations with fine granulation that opens prospects for hyperperformance at the expense of avoiding traditional memory-processor bottleneck using computing memory implementations. Sleptsov net program is entirely graphical and uses textual inscriptions as comments only. The Special Issue covers a wide range of application area including systems control, numerical solving partial differential equations, environmental and cybersecurity tasks, fuzzy systems and others. A wide range of competing and complementary approaches to programming using Petri net graph is of interest to select, preserve and foster prospective findings. The basic motivation for programming in Petri/Sleptsov nets is a new kind of programming technology that preservs original concurrency of the application area, formal techniques for concurrent program verification, and hyperperformance of mass parallel computations with fine granulation, especially when specialized hardware is designed to run a Peri/Sleptsov net program.

Topics of interest include but are not limited to:

• Technology of programming in Petri and Sleptsov nets
• Architecture of fast massively parallel processor of Petri/Sleptsov nets
• Compiling and linking Petri/Sleptsov net programs
• Operating systems of a Petri/Sleptsov net computer
• Application of Sleptsov net programming to fast numerical solving partial differential equations and systems control
• Loading Petri net graph with textual programming languages
• Entirely graphical programming in Petri/Sleptsov nets
• Universal Petri and Sleptsov nets
• Verification of concurrent programs using Petri nets
• Programming using nested and object Petri nets
• Simulating of biocomputing, molecular and chemical computing systems by Petri/Sleptsov nets
• Simulating of amorphous computing and arrays of actuators by Petri/Sleptsov Nets
• Petri/Sleptsov net based cybersecyrity, fast encription/decription, and key exchange systems
• Verification of networking and distributed systems protocols by Petri/Sleptsov nets
• Computational complexity of Petri/Sleptsov net programs
• Specifying energy efficient algorithms, technology and systems by Petri/Sleptsov nets
• Performance evaluation of Petri/Sleptsov net programs
• Implementation of Petri/Sleptsov net processor as a memristor lattice
• Modeling grid and cloud computing systems by Petri/Sleptsov nets
• Modeling evolutionary computing and genetic algorithms by Petri/Sleptsov nets
• Modeling neuron networks by Petri/Sleptsov nets
• Petri/Sleptsov net models for quantum computing
• Petri/Sleptsov nets for automated manufacture systems
• Petri/Sleptsov nets for avionics

Select "special issue title” when submitting your paper to ScholarOne

Instructions for AuthorsSubmit an Article