Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 230 for “"finite state machine"”.

  1. A Finite State Machine Synthesizer

    This thesis presents a Finite State Machine (FSM) Synthesizer developed at Portland State University. The synthesizer starts from a high level behavioral description, in which no states are specified, and generates the lower level FSM descriptions for simulation and physical layout generation.

    portland-state Repository record for A Finite State Machine Synthesizer (opens in a new tab)

  2. A Finite State Machine CASE Tool

    Software systems specified in terms of states and events such as communication protocols, window applications, and various data processing algorithms, are easily implemented by Finite State Machines (FSMs). State transition graphs and tables are two common methods of graphically representing FSMs. …

    texas-state Repository record for A Finite State Machine CASE Tool (opens in a new tab)

  3. Hardware Implementation of Finite State Machine Watermarking Technique

    … embeds a robust watermark in the IP design's Finite State Machine (FSM) by making use of coinciding as well as unused transitions in the state transition graph. This is a first of its kind public key IP watermarking scheme implementation at the FSM level used as copyright protection technique. …

    boise Repository record for Hardware Implementation of Finite State Machine Watermarking Technique (opens in a new tab)

  4. Approximate Sub-Graph Isomorphism For Watermarking Finite State Machine Hardware

    … by selectively embedding a watermark in the state encoding of the Finite State Machine. This form of watermarking can be achieved by matching a directed graph representation of the watermark with a sub-graph in state transition graph representation of the FSM. We experiment with three …

    usf Repository record for Approximate Sub-Graph Isomorphism For Watermarking Finite State Machine Hardware (opens in a new tab)

  5. FiniteFuzz : Finite State Machine Fuzzer For Industrial Control IoT Devices

    … the most prevalent approaches. However, fuzzing Finite State Machines (FSMs) poses a significant challenge due to state and input dependency, resulting in exponential exploration time required to unlock the Finite State Machine. To address this issue, we present a novel approach in this research …

    vt Repository record for FiniteFuzz : Finite State Machine Fuzzer For Industrial Control IoT Devices (opens in a new tab)

  6. Automated design of a microprogrammed controller for a Finite State Machine.

    A Scalable Complementary Metal Oxide Semiconductor (SCMOS) microprogrammed controller for the Monterey Silicon Compiler (MSC) is implemented in the LISP programming language. The internal organization of MSC and the architecture of Very Large Scale Integrated (VLSI) circuits generated by MSC are …

    nps Repository record for Automated design of a microprogrammed controller for a Finite State Machine. (opens in a new tab)

  7. Finite-state Machine Construction Methods and Algorithms for Phonology and Morphology

    This dissertation is concerned with finite state machine-based technology for modeling natural language. Finite-state machines have proven to be efficient computational devices in modeling natural language phenomena in morphology and phonology. Because of their mathematical closure properties, …

    arizona-thes Repository record for Finite-state Machine Construction Methods and Algorithms for Phonology and Morphology (opens in a new tab)

  8. Analysis, design, and logic synthesis of finite-state machine-based Stochastic computing

    … and scaled addition effectively while finite-state machines (FSMs) can implement complex functions such as exponentiation and tanh effectively. Although the combinational logic-based stochastic computing elements had been well studied, they are inefficient for complex operations. The …

    umn Repository record for Analysis, design, and logic synthesis of finite-state machine-based Stochastic computing (opens in a new tab)

  9. A Finite State Machine Approach to Cluster Identification Using the Hoshen-Kopelman Algorithm

    … of this study was to develop an efficient finite state machine implementation of the eponymous Hoshen-Kopelman cluster identification algorithm using the nearest-eight neighborhood rule suitable to applications such as computer modeling for landscape ecology. The implementation presented in …

    utk-theses Repository record for A Finite State Machine Approach to Cluster Identification Using the Hoshen-Kopelman Algorithm (opens in a new tab)

  10. A parallel implementation of the Hoshen-Koppelman Algorithm using a finite state machine

    … presented. The implementations pre-sented use a finite state machine to reduce redundant integer comparisons during the cluster identification process. Sequential efforts concentrated on <em>large-scale</em> maps and an efficient algorithm for performing cluster identification by partitioning the …

    ut-knoxville Repository record for A parallel implementation of the Hoshen-Koppelman Algorithm using a finite state machine (opens in a new tab)

  11. On Controlling a Pediatric Lower-Limb Exoskeleton Using Finite-State Machine and Electroencephalography

    … this need, the Laboratory for Non-Invasive Brain-Machine Interface Systems at the University of Houston in collaboration with Center for Wearable Exoskeletons at TIRR Memorial Hermann has developed a Pediatric Lower-Extremity Gait System (P-LEGS). This dissertation aims at building a control …

    houston Repository record for On Controlling a Pediatric Lower-Limb Exoskeleton Using Finite-State Machine and Electroencephalography (opens in a new tab) Embargoed until 2026-12-01

  12. Test Generation from an Extended Finite State Machine as a Multiobjective Optimization Problem

    Extended Finite State Machines are widely used in different phases of software development including software testing. In this Ph.D. dissertation, we argue that test generation from an Extended Finite State Machine (EFSM) can be considered as a multiobjective optimization problem. When a test …

    carleton Repository record for Test Generation from an Extended Finite State Machine as a Multiobjective Optimization Problem (opens in a new tab)

  13. Print preview using finite state machine emulation of an IBM 3812 page printer

    A methodology and prototype has been developed which enables users of GML and SCRIPT on an IBM 3090 to preview documents on a locally attached personal computer before printing. Currently, no utility exists to accomplish this activity. This new preview process is graphical in nature and provides an …

    vt Repository record for Print preview using finite state machine emulation of an IBM 3812 page printer (opens in a new tab)

  14. Search-based software engineering: A search-based approach for testing from extended finite state machine (EFSM) models

    The extended finite state machine (EFSM) is a powerful modelling approach that has been applied to represent a wide range of systems. Despite its popularity, testing from an EFSM is a substantial problem for two main reasons: path feasibility and path test case generation. The path feasibility …

    brunel Repository record for Search-based software engineering: A search-based approach for testing from extended finite state machine (EFSM) models (opens in a new tab)

  15. Test case generation and fault diagnosis methods for communication protocols based on FSM and EFSM models

    … issues in test case generation from the FSM (finite state machine) and EFSM (extended finite state machine) models.

    concordia Download PDF for Test case generation and fault diagnosis methods for communication protocols based on FSM and EFSM models (opens in a new tab)

  16. Simulation and mathematical notation of alarms unit for computer assisted resuscitation algorithm

    … high and low blood pressure. Using the alarms finite state machine already provided simulation of the alarms unit was done. The alarms finite state machine was constructed by using the requirements [2] provided by WRAIR [Walter Reed Army Institute of Research]. A mathematical specification was …

    njit Repository record for Simulation and mathematical notation of alarms unit for computer assisted resuscitation algorithm (opens in a new tab)

  17. Stability Analysis of Jump-Linear Systems Driven by Finite-State Machines with Markovian Inputs

    … systems, i.e., a dynamical system switched by a finite-state machine or an automaton. When the plant and controller are linear, such a system can be modeled as a jump-linear system driven by a finite-state machine with a random input process. Such fault recovery mechanisms are found in flight …

    odu Repository record for Stability Analysis of Jump-Linear Systems Driven by Finite-State Machines with Markovian Inputs (opens in a new tab)

  18. State machine interpretation of arithmetic codes for joint source and channel coding

    … arithmetic codes with forbidden symbols. With a finite state machine interpretation of arithmetic codes, we can derive a variable input symbol length and variable output bit length trellis to decode the arithmetic codes. Compared to previous results, a significant performance gain (2dB) can be …

    nebraska Repository record for State machine interpretation of arithmetic codes for joint source and channel coding (opens in a new tab)

  19. On the average case approximability of some NP optimization problems

    … to any given constant factor $\epsilon>0$ by a finite state machine. Precisely, let $\Pi$ be a problem in the subclass of NP optimization problems in our subclass. Suppose that the input I of $\Pi$ is a random sequence over all inputs according to a given probability measure $\mu$. Let n be the …

    nebraska Repository record for On the average case approximability of some NP optimization problems (opens in a new tab)

Page 1 of 12