scientific article; zbMATH DE number 3862445
[For the entire collection see Zbl 0534.00018.] This paper presents a description model for nets of communicating processes (by example protocol entities). It is based on the classical model of finite state machines (Moore-Mealy), where a transition is composed of: reading a message, sending a message and changing the state of the automaton, whereas in the three-phase automata it consists of: sending a message, reading a message, internal action, changing the state. This allows to express simultaneous exchanges of messages which is not possible in the classical model. We also consider the communication channels as such machines and we specify a system as a closed network of machines running in a synchronous way.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3330516)