Wolfgang Grieskamp, Yuri Gurevich, Wolfram Schulte, and Margus Veanes
We give an algorithm that derives a finite state machine (FSM) from a given abstract state machine (ASM) specification. This allows us to integrate ASM specs with the existing tools for test case generation from FSMs. ASM specs are executable but have typically too many, often infinitely many states. We group ASM states into finitely many hyperstates which are the nodes of the FSM. The links of the FSM are induced by the ASM state transitions.
|Published in||ISSTA 2002|
|Series||Software Engineering Notes|