Communicating finite-state machine explained

In computer science, a communicating finite-state machine is a finite state machine labeled with "receive" and "send" operations over some alphabet of channels. They were introduced by Brand and Zafiropulo,^[1] and can be used as a model of concurrent processes like Petri nets. Communicating finite state machines are used frequently for modeling a communication protocol since they make it possible to detect major protocol design errors, including boundedness, deadlocks, and unspecified receptions.^[2]

The advantage of communicating finite state machines is that they make it possible to decide many properties in communication protocols, beyond the level of just detecting such properties. This advantage rules out the need for human assistance or restriction in generality.

Communicating finite state machines can be more powerful than finite state machines in situations where the propagation delay is not negligible (so that several messages can be in transit at one time) and in situations where it is natural to describe the protocol parties and the communication medium as separate entities.

Communicating hierarchical state machine

Hierarchical state machines are finite state machines whose states themselves can be other machines. Since a communicating finite state machine is characterized by concurrency, the most notable trait in a communicating hierarchical state machine is the coexistence of hierarchy and concurrency. This has been considered highly suitable as it signifies stronger interaction inside the machine.

However, it was proved that the coexistence of hierarchy and concurrency intrinsically costs language inclusion, language equivalence, and all of universality.^[3]

Definition

Protocol

For an arbitrary positive integer

N , a protocol with N process(es) is a quadruple \{ (S _{i)} ^{N, (o} ^{i)} ^{N, (M} ^{i,j} ) ^{N} _{i =1} \} with:(S _{i)} ^{N} ^{i =1} , a sequence of N disjoint finite sets. Each set is used to represent a process, and each element of S _{i} represents a possible state of the i -th process.(o _{i)} ^{N} ^{i =1} (with o _{i\in} S _{i} ), a sequence representing the initial state of each process.(M _{i,j} ) ^{N} _{i,j =1} , a finite sequence of N ^{2} disjoint finite sets such that each set M _{i,j} represents the possible messages which may be sent from process i to process j . If i = j , then M _{i,j} is empty.( succ ) ^{N} _{i =1} : S _{i} x c up ^{N} _{j =1} \left( M ^{[ + ]} _{j,i} \cup M ^{[ - ]} _{i,j} \right) \mapsto S _{i} is a sequence of transition functions. Each function modelizes the transition which can be taken by emitting or receiving any message. With respect to process i , the symbol [ + ] is used to note a message that can be received and [ - ] a message that can be sent.

Global state

A global state is a pair

\langle S,C\rangle where S = (s _{1,} ..., s _{N)} is an ordered collection of states such that each s _{i} represents a state of the i -th process.C is an N x N matrix such that each c _{i,j} \in C is a subsequence of M _{i,j} .

The initial global state is a pair

\langle O, \Epsilon \rangle whereO = (o _{1,} ..., o _{N)} \Epsilon is defined to be an N x N matrix such that for all i,j \in \{ 1 , ..., N \} , E _{i,j} equals the empty word, \epsilon .

Step

There are two kinds of steps, steps in which message are received and steps in which messages are sent.

A step in which the

j process receive a messagepreviously sent by the i -th process is a pair of the form\left\langle(s _{1,...,s} _{j,...,s} _{n),\left(\begin{array}{lll}c} _{1,1} & ... &c _{1,n} \\ ... & ... & ... \\ ... &m _{i,j} c _{i,j} & ... \\ ... & ... & ... \\c _{n,1} & ... & c _{n,n} \end{array}\right)\right\rangle \vdash \left\langle(s _{1,...,s'} _{j,...,s} _{n),\left(\begin{array}{lll}c} _{1,1} & ... &c _{1,n} \\ ... & ... & ... \\ ... &c _{i,j} & ... \\ ... & ... & ... \\c _{n,1} & ... & c _{n,n} \end{array}\right)\right\rangle when succ _{i} (s _{j,+m} _{i,j} ) = s' _{j} , with m' _{i,j} \in M _{i,j} . Similarly, a pair in which a message is sent by the i -th process to the j -th one is a pair of the form \left\langle(s _{1,...,s} _{i,...,s} _{n),\left(\begin{array}{lll}c} _{1,1} & ... &c _{1,n} \\ ... & ... & ... \\ ... &c _{i,j} & ... \\ ... & ... & ... \\c _{n,1} & ... & c _{n,n} \end{array}\right)\right\rangle \vdash \left\langle(s _{1,...,s'} _{i,...,s} _{n),\left(\begin{array}{lll}c} _{1,1} & ... &c _{1,n} \\ ... & ... & ... \\ ... &m _{i,j} c _{i,j} & ... \\ ... & ... & ... \\c _{n,1} & ... & c _{n,n} \end{array}\right)\right\rangle when succ _{i} (s _{i,-m} _{i,j} ) = s' _{i}

Run

A run is a sequence of global states such that a step relate a state to the next one, and such that the first state is initial.

It is said that a global state

\langle S,C\rangle is reachable if there exists a run passing through this state.

Problems

It has been proved with the introduction of the concept itself that when two finite state machines communicate with only one type of messages, boundedness, deadlocks, and unspecified reception state can be decided and identified while such is not the case when the machines communicate with two or more types of messages. Later, it has been further proved that when only one finite state machine communicates with single type of message while the communication of its partner is unconstrained, we can still decide and identify boundedness, deadlocks, and unspecified reception state.

It has been further proved that when the message priority relation is empty, boundedness, deadlocks and unspecified reception state can be decided even under the condition in which there are two or more types of messages in the communication between finite state machines.^[4]

Boundedness, deadlocks, and unspecified reception state are all decidable in polynomial time (which means that a particular problem can be solved in tractable, not infinite, amount of time) since the decision problems regarding them are nondeterministic logspace complete.

Extensions

Some extensions considered are:

• having a notation to state that some states may not receive any message,
• messages are received in different orders, such as FILO,
• some messages may get lost,

Channel system

See main article: Channel system (computer science). A channel system is essentially a version of communicating finite-state machine in which the machine is not divided into distinct process. Thus, there is a single state of state, and there is no restriction relating which system can read/write on any channel.

Formally, given a protocol

\langle (S _{i} ) ^{n,} _{i =1} (o _{i} ) ^{n,} _{i =1} (M _{i,j} ) ^{n,( succ )} _{i\rangle} , its associated channel system is \langle \prod(S _{i} ) ^{n,} _{i =1} (o _{i} ) ^{n,} _{i =1} c up ^{n(M} _{i,j} ),\Delta\rangle , where \Delta is the set of ((s _{1,...,s} _{j,...,s} _{n),?m} _{i,j} ,(s _{1,...,succ} _{j(s} _{j,+m} _{i,j} ), ... ,s _{n)} and of ((s _{1,...,s} _{i,...,s} _{n),!m} _{i,j} ,(s _{1,...,succ} _{i(s} _{i,-m} _{i,j} ), ... ,s _{n)} .

References

1. D. Brand and P. Zafiropulo. On communicating finite-state machines. Journal of the ACM, 30(2):323–342, 1983.
2. Rosier, Louis E; Gouda, Mohamed G. Deciding Progress for a Class of Communicating Finite State Machines. Austin: University of Texas at Austin, 1983.
3. Alur, Rajeev; Kannan, Sampath; Yannakakis, Mihalis. "Communicating hierarchical state machines," Automata, Languages and Programming. Prague: ICALP, 1999
4. Gouda, Mohamed G; Rosier, Louis E. "Communicating finite state machines with priority channels," Automata, Languages and Programming. Antwerp: ICALP, 1984