On basic rewriting rules to verify communicating machines

Abstract

Absract-In this paper we propose a new methodology to verify communicating machines which can represent processes in communication. This approach is defined in a syntactic manner and based on an isomorphism qi and production rules ab ---> b a (semi-commutations) and ab <---> ba (partial commutations).Words and regular expressions can modelize the processes which communicate over unbounded FIFO channels in passing messages with Send and Receive primitives. Our approach is used in the case where the reachability graph is infinite. Several applications are given for distributed algorithms and protocols of the communication.