Reduced checking sequences using unreliable reset

Jourdan, Guy-Vincent; Ural, Hasan; Yenigün, Hüsnü

doi:10.1016/j.ipl.2015.01.002

Cited by 25 publications

(19 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Finite automata (FA) have many practical applications. They have been used in various fields, including automata theory, robotics, biocomputing, set theory, propositional calculus, model-based testing, and many more [1][2][3][4][5][6][7][8][9][10][11][12].…”

Section: Introductionmentioning

confidence: 99%

Parallel brute-force algorithm for deriving reset sequences from deterministic incomplete finite automata

Türker¹

2019

Turk J Elec Eng & Comp Sci

View full text Add to dashboard Cite

A reset sequence (RS) for a deterministic finite automaton A is an input sequence that brings A to a particular state regardless of the initial state of A . Incomplete finite automata (FA) are strong in modeling reactive systems, but despite their importance, there are no works published for deriving RSs from FA. This paper proposes a massively parallel algorithm to derive short RSs from FA. Experimental results reveal that the proposed parallel algorithm can construct RSs from FA with 16,000,000 states. When multiple GPUs are added to the system the approach can handle larger FA.

show abstract

Section: Introductionmentioning

confidence: 99%

Parallel brute-force algorithm for deriving reset sequences from deterministic incomplete finite automata

Türker¹

2019

Turk J Elec Eng & Comp Sci

View full text Add to dashboard Cite

show abstract

“…Locating sequences are used to make sure that every element of a characterizing set is applied to the same state. Jourdan et al generated shorter test sequences by means of reducing the number of locating sequences [30]. Baumgartner et al proposed a mixed integer nonlinear programming (MINLP) model to formalize how the total cost of testing depends on the sequence and the parameters of the elementary test steps [31].…”

Section: Related Workmentioning

confidence: 99%

Test Sequence Reduction of Wireless Protocol Conformance Testing to Internet of Things

Lin

Zeng

Gao

et al. 2018

Security and Communication Networks

View full text Add to dashboard Cite

Wireless communication protocols are indispensable in Internet of Things (IoT), which refer to rules and conventions that must be followed by both entities to complete wireless communication or service. Wireless protocol conformance testing concerns an effective way to judge whether a wireless protocol is carried out as expected. Starting from existing test sequence generation methods in conformance testing, an improved method based on overlapping by invertibility and multiple unique input/output (UIO) sequences is proposed in this paper. The method is accomplished in two steps: first, maximum-length invertibility-dependent overlapping sequences (IDOSs) are constructed, then a minimum-length rural postman tour covering the just constructed set of maximum-length IDOSs is generated and a test sequence is extracted from the tour. The soundness and effectiveness of the method are analyzed. Theory and experiment show that desirable test sequences can be yielded by the proposed method to reveal violations of wireless communication protocols in IoT.

show abstract

“…Therefore, it is required to bring the implementation under test to this particular state, regardless of the initial state of the implementation, which can be accomplished by using a synchronizing sequence. Even when the implementation has a reset input for this purpose, there are cases where using a synchronizing sequence is preferred [5]. For more examples of application areas of synchronizing sequences and for an overview of the theoretical results related to synchronizing sequences please see [11].…”

Section: Introductionmentioning

confidence: 99%

Synchronizing Heuristics for Weakly Connected Automata with Various Topologies

Çirişci

Sevilmiş

Sivri

et al. 2019

Communications in Computer and Information Science

Self Cite

View full text Add to dashboard Cite

The problem of finding a synchronizing sequence for an automaton is an interesting problem studied widely in the literature. Finding a shortest synchronizing sequence is an NP-Hard problem. Therefore, there are heuristics to find short synchronizing sequences. Some heuristics work fast but produce long synchronizing sequences, whereas some heuristics work slow but produce relatively shorter synchronizing sequences. In this paper, we propose a method for using these heuristics by considering the strongly connectedness of automata. Applying the proposed approach of using these heuristics make the heuristics work faster than their original versions, without sacrificing the quality of the synchronizing sequences.

show abstract

Reduced checking sequences using unreliable reset

Cited by 25 publications

References 13 publications

Parallel brute-force algorithm for deriving reset sequences from deterministic incomplete finite automata

Parallel brute-force algorithm for deriving reset sequences from deterministic incomplete finite automata

Test Sequence Reduction of Wireless Protocol Conformance Testing to Internet of Things

Synchronizing Heuristics for Weakly Connected Automata with Various Topologies

Contact Info

Product

Resources

About