Relations between networks of standard automata and networks of I/O automata

Abstract

The paper compares networks of standard automata and networks of I/O automata with respect to their modelling power for composite discrete-event systems. It shows the similarities and the differences of both modelling philosophies and proves for the parallel composition of standard automata that an equivalent network of I/O automata exists. The constructive proof shows the specific choice of the I/O automata that makes the state transition functions of both automata networks identical. Hence, both modelling approaches share the modelling power at least for the class of discrete-event systems considered in this paper.