Patent ID: 6345042
Filing Date: 2002-02-05
Classification: H04L

Abstract:
A method for checking a data exchange between communication participants (A, B) established on a communication medium (CM) in compliance with a communication protocol whereinthe communication protocol is defined by a protocol automaton based on an extended finite state automaton principle, said automaton describing the correct communication behaviour of a communication participant (e.g. A), the data exchange is captured by means of a protocol monitor (PM) connected to the communication medium (CM), said monitor including a test automaton which is likewise defined according to the extended finite state automaton principle, the test automaton contains the same state variables as the protocol automaton defining the communication protocol, with an exception that each state variable of the test automaton is allocated one element of the power set of the value range of the corresponding state variable of the protocol automaton so that each allocation of the state variable of the test automaton represents a set of states for the protocol automaton which are to be considered, based on one state of the test automaton which comprises all the values of the state variables of the protocol automaton, all state transitions of the protocol automaton which are permissible for at least one of the states of the protocol automaton described by the respective state of the test automaton are consecutively speculatively applied to each of the existing states of the test automaton, which state transitions are furthermore compatible with the messages occurring in the captured data exchange, wherein a) the respective state of the test automaton is first of all stated more precisely according to the logical switching condition of the state transition to be applied and an associated message in the captured data exchange, b) subsequently, in accordance with the state transition of the protocol automaton, a single sequential state of the test automaton is formed describing all the states of the protocol automaton which may be generated as a result of said state transition, c) after the application of all permissible state transitions, the respective state according to above feature a) of the test automaton is replaced with all sequential states generated from this state of the test automaton according to above feature b), a violation of the protocol is reported if after a processing step according to above feature c) the states of the test automaton have all been examined without success.