Modeling and Testing of Protocol Systems
David Lee, David G. Su · 1997
Presented are conformance testing of the control portions of protocol systems, which can be modeled by finite state machines and checking sequences that can be used to verify the structural isomorphism of an implementation of the protocol system with its finite state machine-based specification. However, finite state machines are not powerful enough to model data portions associated with many real systems such as Personal HandyPhone Systems and 5 ESS Intelligent Network Application Protocols. Extended finite state machines with variables and means to test them are also presented. Practical systems like ATM Traffic Management Protocols often contain parameters in the input/output cells; they increase the observability of the system but complicate their testing. Our model is further extended to communicating parameterized extended finite state machines for the test generation.