An algebraic approach to validate communication protocols

Realizing the need for a precise model of computer communications protocols, many different approaches are being investigated. The author presents an algebraic approach to formally specify protocols composed of many modules. The protocols studied are described in the model of finite state machine and then transformed into a set of process equations. The main concept consists in carrying out transformations on these equations in order to prove some properties. The reachability analysis can then be defined in the form of algebraic transformation rules applied to the global system states. The properties to verify during the communication between processes are the detection of some logical errors such as deadlocks, blocking or unspecified receptions.<
>