Comparing Graph-Based Algorithms to Generate Test Cases from Finite State Machines

Mariano, Matheus Monteiro; Souza, Érica Ferreira de; Endo, André Takeshi; Vijaykumar, Nandamudi Lankalapalli

doi:10.1007/s10836-019-05844-6

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2021

2024

Publication Types

Select...

Other3

Book2

Article1

Relationship

Self Cite0

Independent6

Authors

Journals

Cited by 7 publications

(1 citation statement)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several formal models exist for system specifications, such as behaviour trees [8], Finite State Machines (FSMs) [6], [15], [18] and labelled transition systems [6]. This article focuses on FSM formal models, which have been extensively used in diverse areas such as telecommunication software and protocols [13], [14], software related to lexical analysis and pattern matching [3], hardware design [24] and embedded systems [5].…”

Section: Introductionmentioning

confidence: 99%

Test generation algorithm for the All-Transition-State criteria of Finite State Machines

Németh¹,

Lugosi²

2021

Infocommunications journal

View full text Add to dashboard Cite

In the current article a novel test generation algorithm is presented for deterministic finite state machine specifications based on the recently introduced All-Transition-State criteria. The size of the resulting test suite and the time required for test suite generation are investigated through analytical and practical analyses and are also compared to the Transition Tour, Harmonized State Identifiers and random walk test generation methods. The fault detection capabilities of the different approaches are also investigated with simulations applying randomly injected transfer faults.

show abstract