Abstract:
A labeled system of interconnected graphs is a model which enables explicit description of process properties such as modularity, parallelism, and hierarchy. As far as function computation and language representation are concerned the model is shown to be at least as good as the Turing machine. Interconnected graphs of usual (even automaton) Petri nets are shown to have the same potential. 166
Fulltext:
PDF file (2172 kB)