Blocking regulation methods in automaton network

Blocking dynamics in automaton network are fundamental to discrete system modelling and control. Current research predominantly addresses single-automaton blocking analysis, yet systematic studies on composite automaton networks remain limited. This paper investigates product and parallel automaton networks to establish their blocking dependencies on component automata and propose effective regulation strategies. Through component automata examples, three scenarios–non-blocking, fully blocking, and partially blocking–are analysed to characterise network-level blocking dynamics. Based on language and automata properties, this paper derives the core non-blocking conditions for product automaton network and parallel automaton networks. Corresponding regulation strategies are proposed: adjusting marked states, extending transition functions, and so on. Results demonstrate that blocking in these networks is governed not by component states, but by shared-event synchronisation capability, marked-state compatibility, and so on. The key innovation lies in the comprehensive multi-scenario analysis of both network types and the development of universally applicable regulation frameworks.