CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
research
Distinguishing sequences for partially specified FSMs
Authors
A. Gill
A. Petrenko
+24 more
A. Petrenko
A. Silva Simão da
A. Silva Simão da
D. Lee
D. Lee
D.P. Sidhu
E. Brinksma
G. Gonenc
G.-V. Jourdan
H. Ural
H. Ural
I. Pomeranz
K. Sabnani
M. Haydar
M. Mihail
M. Utting
M. Yannakakis
R. Lai
R.M. Hierons
R.T. Boute
S. Fujiwara
T.S. Chow
W. Grieskamp
W.J. Savitch
Publication date
1 January 2014
Publisher
'Springer Science and Business Media LLC'
Doi
Cite
Abstract
Distinguishing Sequences (DSs) are used inmany Finite State Machine (FSM) based test techniques. Although Partially Specified FSMs (PSFSMs) generalise FSMs, the computational complexity of constructing Adaptive and Preset DSs (ADSs/PDSs) for PSFSMs has not been addressed. This paper shows that it is possible to check the existence of an ADS in polynomial time but the corresponding problem for PDSs is PSPACE-complete. We also report on the results of experiments with benchmarks and over 8 * 106 PSFSMs. © 2014 Springer International Publishing
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Sustaining member
Brunel University Research Archive
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:bura.brunel.ac.uk:2438/998...
Last time updated on 18/05/2015
Crossref
See this paper in CORE
Go to the repository landing page
Download from data provider
info:doi/10.1007%2F978-3-319-0...
Last time updated on 05/06/2019