Classification Tree Method: Difference between revisions

Revision as of 10:02, 13 August 2013

Revision as of 10:19, 13 August 2013

Line 68:

=== Classification Tree Method for Embedded Systems ===

[[File:Classification Tree for Embedded System.png|thumb|Classification Tree for Embedded System Example containing concrete values, concrete timing, (different) transitions and distinguish between States and Actions]]

The classification tree method first was intended for the design and specification of abstract test cases. With the classification tree method for embedded systems<ref>{{cite journal|last=Conrad|first=Mirko|coauthors=Krupp, Alexander|title=An Extension of the Classification-Tree Method for Embedded Systems for the Description of Events|journal=Electronic Notes in Theoretical Computer Science|date=1 October 2006|volume=164|issue=4|pages=3–11|doi=10.1016/j.entcs.2006.09.002}}</ref>, test implementation can also be performed. Several addtional features are integrated with the method: