System of interconnected graphs and simulation of discrete processes

MaRDI QIDQ1058293zbMATH OpenFDO

Authors V. V. Rudnev

Publication date 1984

Published in Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

hierarchymarked system of interconnected graphsmodularityparallelismPetri nets

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Review text

A marked system of interconnected graphs (SIG), which is a model that permits explicit description of process properties such as modularity, parallelism, and hierarchy, is discussed. For function computation and language representation, this model is shown to be as good as the Turing machine. Such possibilities exist for SIGs whose graphs are regular (and even automaton) Petri nets.

Recommendations

• On the generality of event-graph models
• scientific article; zbMATH DE number 3880125
• scientific article; zbMATH DE number 3922334
• Structured neural-like networks for modeling of discrete processes
• Logical representation of algorithmic systems by the Petri-Chomsky machine

Cited in

(4)

• Definition and properties of a computational model with shared informational resources
• On the generality of event-graph models
• scientific article; zbMATH DE number 5845800 (Why is no real title available?)
• scientific article; zbMATH DE number 3880125 (Why is no real title available?)

This page was built for publication: System of interconnected graphs and simulation of discrete processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1058293)