The paper proposes four new transformations for modifying a member of a closed system of communicating state machines (CSMs) without considering the other CSMs and nevertheless securing that after the modification, the system can reach the same dead states and overfill the same channels, where channels are assumed to be error-free unidirectional first-in-first-out queues. When verifying general correctness properties of a communication protocol whose specification is such a system, one can employ the error-preserving local transformations (EPLTs) for simplifying individual CSMs and thereby the subsequent reachability analysis. The paper proves also a generic EPLT from which further easily applicable EPLTs can be derived simply by specialization Copyright © 2011 John Wiley & Sons, Ltd.
1099-1689/asset/olbannerleft.jpg?v=1&s=f177ca3aecdb1afaf18649c31eb98c6a5a2ba179)
1099-1689/asset/olbannerright.jpg?v=1&s=c31cdb59b8e8855ed28bf83573e9f1693e3f9a0e)
