Generating finite state machines from abstract state machines
Authors:
Open Access
- 1 July 2002
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGSOFT Software Engineering Notes
- Vol. 27 (4) , 112-122
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.Keywords
This publication has 9 references indexed in Scilit:
- Sequential abstract-state machines capture sequential algorithmsACM Transactions on Computational Logic, 2000
- Application of finite automatons for program testingProgramming and Computer Software, 2000
- KVEST: Automated Generation of Test Suites from Formal SpecificationsLecture Notes in Computer Science, 1999
- An experiment in automatic generation of test suites for protocols with verification technologyScience of Computer Programming, 1997
- Automating test case generation from Z specifications with Isabelle1997
- Principles and methods of testing finite state machines-a surveyProceedings of the IEEE, 1996
- Automatic generation of functional vectors using the extended finite state machine modelACM Transactions on Design Automation of Electronic Systems, 1996
- Protocol testing1994
- Formal methods for protocol testing: a detailed studyIEEE Transactions on Software Engineering, 1989