Generating finite state machines from abstract state machines
ACM SIGSOFT Software Engineering Notes2002Vol. 27(4), pp. 112–122
Citations Over TimeTop 1% of 2002 papers
Abstract
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.
Related Papers
- → Generating finite state machines from abstract state machines(2002)182 cited
- → Generating finite state machines from abstract state machines(2002)78 cited
- → Interaction Object Graphs: An Executable Graphical Notation for Specifying User Interfaces(1998)2 cited
- Repid Design of Finite State Machine with STATECAD(2006)
- → Tutorial on the Executable ASM Specification of the AB Protocol and Comparison with TLA$^+$(2023)