As part of the UD's and CCNY's ongoing effort to generate conformance tests for the Army network protocol MIL-STD 188-220, a significant obstacle has been addressedwhen multiple timers are running simultaneously, a test sequence may become unrealizable if there are conflicting conditions based on a protocol's timers. This problem, termed the conflicting timers problem, is handled in the hitherto generated tests by manually expanding a protocol's extended FSM based on the set of conflicting timers, resulting in test sequences that are far from minimum-length. Similar inconsistencies, but based on arbitrary linear variables, are present in the extended FSMs modeling VHDL specifications. This paper presents an efficient solution to the conflicting timers problem that eliminates the redundancies of manual state expansion. CCNY's inconsistency removal algorithms are applied to a new model for testing protocols with multiple timers, in which complex timing dependencies are captured by simple linear expressions. This test generation technique is expected to significantly shorten the test sequences without compromising their fault coverage.
In REF , the authors present a method for testing real-time protocols with multiple conflicting timers.
Test Generation In The Presence Of Conflicting Timers
In
Engineering Computer Science