Networks of Moore Machines
For researchers in automata theory and system design, this provides a formal framework for scalable network composition, but it is incremental as it combines existing concepts.
The paper presents a method for constructing and analyzing large-scale networks of Moore machines using a product with feedback from 1962 and primitive recursive functions from 1950, enabling parallel state changes and abstract property definition without state enumeration.
A product of Moore machines with feedback published in 1962 by Juris Hartmanis and a class of primitive recursive functions on finite sequences published in a textbook by Roza Peter originally in 1950 are keys to a method for working with large scale networks of Moore type state machines. The product provides a basis for connecting Moore machines in an arbitrary network so they construct a new Moore machine in which they act as components that change state in parallel. The functions provide a means of defining machines, machine products, and abstract properties of the machines without enumerating states.