Networks of Moore Machines

TL;DR

This paper explores a method for constructing large networks of Moore machines using their product operation and primitive recursive functions, enabling complex system modeling without explicit state enumeration.

Contribution

It introduces a novel approach combining Moore machine products and primitive recursive functions for scalable network modeling.

Findings

Provides a formal basis for connecting Moore machines in arbitrary networks.

Uses primitive recursive functions to define machine properties abstractly.

Facilitates modeling of large-scale systems without enumerating states.

Abstract

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.