A Method for Minimizing the Number of Internal States in Incompletely Specified Sequential Networks

Grasselli, A.; Luccio, Fabrizio

doi:10.1109/pgec.1965.264140

Cited by 145 publications

(53 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…4. Part 2: Minimize the machine: Using this modified machine, a traditional minimization algorithm (Grasselli and Luccio 1965;Pena and Oliveira 1998) is applied to obtain a reduced FSM. In this example, states s2 and s3 are not distinguishable and then merged in one state s2-3, as shown in Fig.…”

Section: Heuristic Hsi Methods (Hhsi)mentioning

confidence: 99%

“…Formally, any FSM can be reduced using direct application of FSM minimization (Grasselli and Luccio 1965;Pena and Oliveira 1998). However, as discussed, this causes the states that do not have the same set of enabled inputs, that is, incompatible states, to be merged in the reduced machine.…”

Section: Heuristic Hsi Methods (Hhsi)mentioning

confidence: 99%

“…Motivated by the adoption of test generation methods and by the manipulation of simpler models with redundant states, several algorithms have been proposed to remove redundancy in FSMs (Grasselli and Luccio 1965;Pena and Oliveira 1998). The so-called minimization algorithms [as in (Grasselli and Luccio 1965;Pena and Oliveira 1998)] identify redundant states and try to remove them, while keeping the equivalence between the original and modified machine. At the end, a reduced specification is produced.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Fault domain-based testing in imperfect situations: a heuristic approach and case studies

et al. 2014

View full text Add to dashboard Cite

Model-based testing (MBT) involves creating an abstraction, called a model, to represent the system and automatically deriving test cases from this model. MBT can be performed using various approaches that generally employ certain assumptions or requirements affecting the test performance in practice. Here, we consider the harmonized state identifiers (HSI) method, which is based on finite state machine (FSM) models and generates test sets that cover all faults in a given domain under certain conditions. We are interested in the application of the HSI method in practical scenarios where some conditions do not hold or are not straightforward to satisfy. Thus, we propose a heuristic extension to the HSI method, called heuristic HSI (HHSI), to consider imperfect situations The authors are alphabetically ordered.Electronic supplementary material The online version of this article (doi:10.1007/s11219-014-9242-6) contains supplementary material, which is available to authorized users.

show abstract

Section: Heuristic Hsi Methods (Hhsi)mentioning

confidence: 99%

Section: Heuristic Hsi Methods (Hhsi)mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Fault domain-based testing in imperfect situations: a heuristic approach and case studies

et al. 2014

View full text Add to dashboard Cite

show abstract

“…Exact solutions are proposed in [54,55]. Clearly a method is efficient if it is possible to prevent the exploration of unsuccessful branches at earlier stages of the search, and this relies on efficient bounding techniques [38,39,56,57].…”

Section: Instruction Selectionmentioning

confidence: 99%

The Instruction-Set Extension Problem: A Survey

Galuzzi

Bertels

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract.Over the last years, we have witnessed the increased use of Application-Specific Instruction-Set Processors (ASIPs). These ASIPs are processors that have a customizable instruction-set, which can be tuned towards specific requirements. The identification, definition and implementation of those operations that provide the largest performance improvement and that should be hardwired, extending in this way the Instruction-Set, constitutes a major challenge. The purpose of this paper is to investigate and study the issues regarding the customization of an Instruction-Set in function of the specific requirements of an application. Additionally, the paper provides an overview of all relevant aspects of the problem and compensates the lack of a general view of the problem in the existing literature.

show abstract

“…The problem of minimizing ISFSMs has been studied by a number of researchers [1,2]. However these are not suitable for large problems because the problem is NP-hard.…”

Section: Introductionmentioning

confidence: 99%

A fast state reduction algorithm for incompletely specified finite state machines

Higuchi¹,

Matsunaga²

33rd Design Automation Conference Proceedings, 1996

View full text Add to dashboard Cite

show abstract

A Method for Minimizing the Number of Internal States in Incompletely Specified Sequential Networks

Cited by 145 publications

References 5 publications

Fault domain-based testing in imperfect situations: a heuristic approach and case studies

Fault domain-based testing in imperfect situations: a heuristic approach and case studies

The Instruction-Set Extension Problem: A Survey

A fast state reduction algorithm for incompletely specified finite state machines

Contact Info

Product

Resources

About