We validate speculative and out-of-order execution microarchitecture using an ATPG-like methodology. The validation methodology uses FSM models derived from microarchitecture speciications. Complete transition tours are generated from the FSM models to obtain a high-level test sequence. Small assembly sequences associated with each FSM transition are used to translate FSM testing sequences into...

A generalization of the classical state minimization of a Finite State Machine FSM is described The FSM is minimized here in two dimensions numbers of both input symbols and internal states are mini mized in an iterative sequence of input minimizatio and state minimization procedures For each machine in the sequence of FSMs created by the algorithm an equivalent FSM is found that attempts to mi...

This paper focuses on testing sequential circuits using a simple form of signature analysis as a compaction technique. More specifically, the paper describes a systematic methodology for calculating the probability of aliasing when a randomly generated test input vector sequence is applied to a given finite state machine (FSM) and the final FSM output is used to verify the functionality of the ...

In this study, we aimed to design collaborative virtual learning (CVL) activities by using a five-stage model (FSM) and survey of students’ experiences. The study group consisted of 14 voluntary students in the Turkish Teaching Department. In this case study, data were collected through observations, recordings in Second Life (SL) and interviews. For the data analysis part, descriptive analysis...

This work is centered in the definition of a transition management system for a small autonomous helicopter based on trajectory smoothing and a finite state machine (FSM). A smooth flight schedule decreases transients originated by direction changes and flight mode transitions (e.g., horizontal flight to hover mode). Although previous works have presented trajectory generation and FSM oriented ...

We implemented an iterative nonrigid registration algorithm to accurately combine functional (PET) and anatomical (MRI) images in 3D. Our method relies on a Finite Element Method (FEM) and a set of fiducial skin markers (FSM) placed on breast surface. The method is applicable if the stress conditions in the imaged breast are virtually the same in PET and MRI. In the first phase, the displacemen...

The concepts behind Finite State Machines (FSMs) are introduced, and their operation is shown to be more compatible with SAS than that of traditional procedural programming when processing non-uniform input. A visual representation of FSMs as directed graphs is shown, and an example FSM is drawn. A tabular representation is shown, and its equivalence to the digraph demonstrated along with proce...

Frequent subgraph mining (FSM) is a subsection of graph domain which extensively used for classification and clustering purposes. Over the past decade, many efficient FSM algorithms have been developed. The improvements generally focus on reducing time complexity by changing algorithm structure or using parallel programming techniques. another problem to solve, high memory consumption. In this ...

This paper presents a new level of description between behavioral and state descriptions of a finite-state machine (FSM). The description is termed behavioral phase clustering description. New concepts of behavioral phase and clustering of behavioral phases in an FSM are introduced. The new description simplifies functional analysis, verification and test of FSM designs. If an FSM is described ...

Estimating software size is a difficult task that requires a methodological approach. Many different methods that exist today use distinct abstractions to depict a software system. The gap between abstractions becomes even greater with object-oriented artifacts developed in unified modeling language (UML). In this paper, a formal foundation for the representation of functional size measurement ...