System of interconnected graphs and simulation of discrete processes (Q1058293)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: System of interconnected graphs and simulation of discrete processes |
scientific article; zbMATH DE number 3900159
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | System of interconnected graphs and simulation of discrete processes |
scientific article; zbMATH DE number 3900159 |
Statements
System of interconnected graphs and simulation of discrete processes (English)
0 references
1984
0 references
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.
0 references
marked system of interconnected graphs
0 references
modularity
0 references
parallelism
0 references
hierarchy
0 references
Petri nets
0 references
0.7644197940826416
0 references
0.7286936044692993
0 references
0.7166265845298767
0 references
