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 111 for “"state machine"”.
-
Finite state machine representation of digital signal processing systems
… the filter must be represented as a finite state machine and then implemented using sequential logic circuit synthesis techniques. The logic complexity is found to depend - amongst other considerations - on the so called state (code) assignment. Some preliminary results on this problem are …
-
Scalable Byzantine State Machine Replication: Designs, Techniques, and Implementations
State machine replication (SMR) is one of the most widely studied and used methodology for building highly available distributed applications and services. SMR replicates a service across a set of computing hosts, and executes client operations on the replicas in an agreed- upon total order, …
-
Improving Performance of Byzantine State Machine Replication through Self-Adaptation
Byzantine Fault-Tolerant (BFT) State Machine Replication (SMR) provides strong resilience against faults and intrusions, making it a solid foundation for building dependable distributed systems. However, its practical adoption remains limited due to several challenges: high operational costs …
-
FiniteFuzz : Finite State Machine Fuzzer For Industrial Control IoT Devices
… 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 paper …
-
The State Machine : politics, ideology, and computation in Chile, 1964-1973
… interwoven with the history of the Chilean state. It begins by documenting the government use of mechanical tabulating machines during the 1920s and 1930s and concludes with the disbanding of the state computer enterprise known as ECOM in 1991. The dissertation pays particular attention to …
-
Towards Fast and Adaptive Byzantine State Machine Replication for Planetary-Scale Systems
State machine replication (SMR) is a classical approach for building resilient distributed systems. In Byzantine fault-tolerant (BFT) systems, no concrete assumptions are made about the behavior of faulty replicas. With the advancement of distributed ledger technologies (DLT), planetary-scale BFT …
-
Fault-injection through model checking via naive assumptions about state machine synchrony semantics
Software behavior can be defined as the action or reaction of software to external and/or internal conditions. Software behavior is an important characteristic in determining software quality. Fault-injection is a method to assess software quality through its' behavior. Our research involves a …
-
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 …
-
A finite state machine framework for robust analysis and control of hybrid systems
… control, and is based on the use of finite state machines as nominal models of the hybrid systems. The development does not assume a particular algebraic or topological structure on the signal sets. The thesis adopts an input/output view of systems, proposes specific classes of inequality …
-
RSMLab : a web-based tool for recombinase-based state machine design and visualization
Biological state machines have the potential to enable a wide range of applications but until recently have been challenging to implement experimentally. To overcome this challenge, we described a scalable strategy for assembling biological state machines using recombinases. This platform enables …
-
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 …
-
Dancing cheek to cheek : haptic communication between partner dancers and swing as a finite state machine
… domain. Swing dance choreography is a finite state machine, with moves that transition between a small number of poses. Two automated choreographers are presented. One uses an optimization and randomization scheme to compose dances by a sequence of shortest path problems, with edge lengths …
-
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 …
-
Simulation and mathematical notation of alarms unit for computer assisted resuscitation algorithm
… 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 written …
-
Learning to deal with COTS (commercial off the shelf)
… developed a system that extracts the state machine model from the COTS software using Dana Angluin's L* Algorithm. We also developed a hierarchical approach of viewing the state machine model by static analysis of assembly code.
-
A method for mapping between ASMs and implementation language
… through generating Java code from an abstract state machine (ASM) based modeling language, called the Timed Abstract State Machine (TASM) language. This code generation process involves a series of three transformations. The first transformation creates a specialised System Dependency Graph …
-
Following recipes with a cooking robot
… system was first implemented as a static finite state machine, which was tested through 27 baking attempts, 16 of which successfully resulted in edible cookies. The system was then implemented as a dynamic state machine, in which the robot estimated the world state and planned sequences of motion …
-
Hazard elimination using backwards reachability techniques in discrete and hybrid models
… a particular design can reach a hazardous state and, if it could, how to change the design to ensure that it does not. In most cases, this is done through testing or simulation or even less rigorous processes--none of which provide much confidence for complex systems. Because state spaces …
-
Improving the Efficiency of Graph-Based Static Analysis
… context-free language reachability, recursive state machine reachability and set constraint analysis. In this dissertation, the methodologies focus more on eliminating redundancy rather than theoretically lowering complexity. For transitive redundancy that arises from the massive …
-
Biologically inspired goal directed navigation for mobile robots
… and a bio-inspired approach using an Echo State Network and Liquid State Machine architecture was chosen as the base for the navigation modules. The navigation module implemented in this work is trained to navigate and localise itself in different environments drawing its inspiration from …
Page 1 of 6