Unbounded verification results by finite-state compositional techniques: 10/sup any/ states and beyond

The article describes how to use process algebraic compositional finite state verification techniques for infinite parameterised families of systems. The parameter is incremented by adding a new process, and automated techniques establish that this does not change the externally observable behaviour. Therefore, all systems in the family behave identically. Channel fairness and independence of retransmission bounds are used as examples.