Abstract | ||
---|---|---|
A variety of systems can be modelled as finite-state machines (FSM). Several formal methods have been proposed for testing the conformance of an implementation to a given FSM-based specification. However, all of these methods assume that the specification is modelled by a deterministic FSM. The paper presents an efficient algorithm that generates a set of adaptive all state-pair optimised distinguishing sequences for testing systems modelled as non-deterministic FSMs |
Year | DOI | Venue |
---|---|---|
1993 | 10.1049/sej.1993.0024 | Software Engineering Journal |
Keywords | Field | DocType |
conformance testing,finite state machines,formal specification,adaptive all state-pair optimised distinguishing sequences,conformance,finite-state machines,formal methods,nondeterministic fsms,test generation algorithm | Computer science,Algorithm,Conformance testing,Finite-state machine,Formal specification,Theoretical computer science,Formal methods | Journal |
Volume | Issue | ISSN |
8 | 4 | 0268-6961 |
Citations | PageRank | References |
9 | 0.73 | 6 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Hosam AboElFotoh | 1 | 9 | 0.73 |
Osman Abou-Rabia | 2 | 128 | 22.62 |
Hasan Ural | 3 | 9 | 1.06 |