The class of models studied here can be viewed as generalizing or being related to a great many kinds of abstract systems. One class is graph rewriting systems, also known as graph transformation systems or graph grammars (e.g. ). The models here are generalizations of both the double-pushout and single-pushout approaches. Note that the unlabeled graphs and hypergraphs studied here are different from the typical cases usually considered in graph rewriting systems and their applications.
Multiway systems as used here were explicitly introduced and studied in [1:p204] (see also [1:p938]). Versions of them have been invented many times, most often for strings, under names such as semi-Thue systems , string rewriting systems , term rewriting systems , production systems , associative calculi  and canonical systems .
An outline of applying models of a type very similar to those considered here was given in [1:9]. Some additional exposition was given in . The discussion here contains many new ideas and developments, explored in .
For a survey of ultimate models of physics, see [1:p1024]. The possibility of discreteness in space has been considered since antiquity . Other approaches that have aspects potentially similar to what is discussed here include: causal dynamical triangulation , causal set theory , loop quantum gravity , pregeometry , quantum holography , quantum relativity , Regge calculus , spin networks , tensor networks , superrelativity , topochronology , topos theory , twistor theory . Other discrete and computational approaches to fundamental physics include: .
The precise relationships among these approaches and references and the current work are not known. In some cases it is expected that conceptual motivations may be aligned; in others specific mathematical structures may have direct relevance. The latter may also be the case for such areas as conformal field theory , higher-order category theory , non-commutative geometry , string theory .