Estimating the feasibility of transition paths in extended finite state machines

Derderian, K., Hierons, R.M. orcid.org/0000-0002-4771-1446, Harman, M. et al. (1 more author) (2010) Estimating the feasibility of transition paths in extended finite state machines. Automated Software Engineering, 17. 1. pp. 33-56. ISSN 0928-8910

Abstract

Metadata

Authors/Creators:
Copyright, Publisher and Additional Information: © 2009 Springer Science+Business Media, LLC. This is an author-produced version of a paper subsequently published in Automated Software Engineering. Uploaded in accordance with the publisher's self-archiving policy.
Keywords: EFSM; Transition feasibility; State-based testing; Automated test generation
Dates:
  • Accepted: 7 October 2009
  • Published (online): 3 November 2009
  • Published: March 2010
Institution: The University of Sheffield
Academic Units: The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield)
Depositing User: Symplectic Sheffield
Date Deposited: 19 Nov 2019 16:01
Last Modified: 20 Nov 2019 15:15
Status: Published
Publisher: Springer
Refereed: Yes
Identification Number: https://doi.org/10.1007/s10515-009-0057-9

Share / Export

Statistics